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 notesBixby-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...
Dittert–Hajek conjecture
v1.3 research notesLet $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...
Minimum length of a superpermutation
v1.3 research notesA superpermutation on $n$ symbols is a string containing every permutation of the $n$ symbols as a contiguous substring. Determine the minimum possibl...
Rudin's conjecture on squares in progressions
v1.3 research notesFor 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)$. ...
Combinatorial interpretation of Kronecker coefficients
v1.3 research notesFor 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_{...
Exact Dedekind numbers
v1.3 research notesLet $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...
Exact van der Waerden numbers
v1.3 research notesLet $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 $...
Conjecture of multiplicative persistence
v1.3 research notesFor $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^{...
The 196 conjecture
v1.3 research notesDefine $f:\mathbb{N}\to\mathbb{N}$ by $f(n)=n+\operatorname{rev}(n)$, where $\operatorname{rev}$ reverses the decimal digits. Are there infinitely man...
Union of Fat Objects in 3D
v1.3 research notesWhat is the complexity of the union of ``fat'' objects in $\mathbb{R}^3$?...
$k$-sets
v1.3 research notesWhat is the maximum number of $k$-sets? (Equivalently, what is the maximum complexity of a $k$-level in an arrangement of hyperplanes?)...
Vertical Decompositions in $\mathbb{R}^d$
v1.3 research notesWhat is the complexity of the vertical decomposition of $n$ surfaces in $\mathbb{R}^d$, $d \ge 5$?...
Extending Pseudosegment Arrangements by Subdivision
v1.3 research notesHow many intersections among an arrangement of pseudosegments in the plane must be added as vertices to allow the pseudosegment arrangment to be exten...
Counting Polyominoes
v1.3 research notesHow 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...
Distances among Point Sets in $\mathbb{R}^2$ and $\mathbb{R}^3$
v1.3 research notesFor 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\|...
Monochromatic Triangles
v1.3 research notesFor 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...
Lines Tangent to Four Unit Balls
v1.3 research notesGiven 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...
Rolling a Die over a Labeled Board
v1.3 research notesLabel 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 ...
Slicing Axes-Parallel Rectangles
v1.3 research notesLet 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...