Mathematics Problem Archive

Showing 151-169 of 169 problems (Page 4 of 4)

AMR-030-0089
Open

Let G be a bicolored graph, and let H be the graph whose vertices are the valid pressing sequences of G and whose edges

v1.3 research notes

Bixby-Flint-Miklos : Let G be a bicolored graph, and let H be the graph whose vertices are the valid pressing sequences of G and whose edges connect t...

L3
Combinatorics
AMR-031-0002
Partially Solved

Dittert–Hajek conjecture

v1.3 research notes

Let $A=(a_{ij})$ be an $n\times n$ matrix with nonnegative entries and total entry sum $n$. Define $$\phi(A)=\prod_{i=1}^n\sum_{j=1}^n a_{ij}+\prod_{j...

L3
Combinatorics
AMR-031-0005
Partially Solved

Minimum length of a superpermutation

v1.3 research notes

A superpermutation on $n$ symbols is a string containing every permutation of the $n$ symbols as a contiguous substring. Determine the minimum possibl...

L3
Combinatorics
AMR-031-0008
Partially Solved

Rudin's conjecture on squares in progressions

v1.3 research notes

For positive integers $N,q,a$, let $Q(N;q,a)$ be the number of perfect squares among $a,a+q,\ldots,a+(N-1)q$, and let $Q(N)=\max_{q,a\geq1}Q(N;q,a)$. ...

L4
Combinatorics
AMR-031-0011
Open

Combinatorial interpretation of Kronecker coefficients

v1.3 research notes

For partitions $\lambda,\mu,\nu$ of $n$, the Kronecker coefficient $g_{\mu\nu}^{\lambda}$ is defined by $$V_\mu\otimes V_\nu\cong\bigoplus_\lambda g_{...

L3
Combinatorics
AMR-031-0013
Open

Exact Dedekind numbers

v1.3 research notes

Let $M(n)$ be the number of monotone Boolean functions of $n$ variables, equivalently the number of antichains of subsets of an $n$-element set. Deter...

L4
Combinatorics
AMR-031-0015
Partially Solved

Exact van der Waerden numbers

v1.3 research notes

Let $W(r,k)$ be the least $N$ such that every coloring of $\{1,\ldots,N\}$ with $r$ colors contains a monochromatic arithmetic progression of length $...

L3
Combinatorics
AMR-046-0031
Partially Solved

Conjecture of multiplicative persistence

v1.3 research notes

For $n\in\mathbb{N}$, let $\Pi(n)$ be the product of its decimal digits, and let $\operatorname{Pm}(n)$ be the least positive integer such that $\Pi^{...

L2
Combinatorics
AMR-046-0032
Open

The 196 conjecture

v1.3 research notes

Define $f:\mathbb{N}\to\mathbb{N}$ by $f(n)=n+\operatorname{rev}(n)$, where $\operatorname{rev}$ reverses the decimal digits. Are there infinitely man...

L3
Combinatorics
AMR-054-0004
Open

Union of Fat Objects in 3D

v1.3 research notes

What is the complexity of the union of ``fat'' objects in $\mathbb{R}^3$?...

L3
Combinatorics
AMR-054-0007
Open

$k$-sets

v1.3 research notes

What is the maximum number of $k$-sets? (Equivalently, what is the maximum complexity of a $k$-level in an arrangement of hyperplanes?)...

L3
Combinatorics
AMR-054-0019
Open

Vertical Decompositions in $\mathbb{R}^d$

v1.3 research notes

What is the complexity of the vertical decomposition of $n$ surfaces in $\mathbb{R}^d$, $d \ge 5$?...

L3
Combinatorics
AMR-054-0034
Open

Extending Pseudosegment Arrangements by Subdivision

v1.3 research notes

How many intersections among an arrangement of pseudosegments in the plane must be added as vertices to allow the pseudosegment arrangment to be exten...

L3
Combinatorics
AMR-054-0037
Open

Counting Polyominoes

v1.3 research notes

How many polyominoes on $n$ squares are there? A polyomino is a connected interior-disjoint union of axis-aligned unit squares joined edge-to-edge, in...

L3
Combinatorics
AMR-054-0039
Partially Solved

Distances among Point Sets in $\mathbb{R}^2$ and $\mathbb{R}^3$

v1.3 research notes

For a point set $P$ in $\mathbb{R}^d$, let $f_d(P)$ be the number of unit-distance point pairs: $$f_d(P) = \left| \{ (u,v) \mid u, v \in P, \, \|u-v\|...

L3
Combinatorics
AMR-054-0058
Partially Solved

Monochromatic Triangles

v1.3 research notes

For any (planar) triangle $T$, is there is a $3$-coloring of the (infinite) plane with no monochromatic copy of $T$? We imagine congruent copies of $T...

L3
Combinatorics
AMR-054-0061
Open

Lines Tangent to Four Unit Balls

v1.3 research notes

Given a set of $n$ unit-radius balls in $\mathbb{R}^3$, what is the number of lines that are tangent to four of the balls in the set, and miss all the...

L3
Combinatorics
AMR-054-0068
Open

Rolling a Die over a Labeled Board

v1.3 research notes

Label the faces of a unit cube with numbers $1$--$6$ as in a die. Place the cube to sit on an integer lattice grid, with one corner at the origin and ...

L3
Combinatorics
AMR-054-0074
Open

Slicing Axes-Parallel Rectangles

v1.3 research notes

Let us say that two rectangles in the place are independent if both their $x$- and $y$-axis projections are disjoint. A set of rectangles is then inde...

L3
Combinatorics