15 problems
Extremality conjecture. For all ,
Let be the set of words of length over an alphabet of size , let be the number of colors, and let be the Hales–Jewett number. Let…
Let be the set of words of length over an alphabet of size , let be the number of colors, and let be the Hales–Jewett number. The diagonal is…
Let be the set of words of length over an alphabet of size , let be the number of colors, and let denote the least dimension forcing a m…
Collapse conjecture.
Periodic coloring conjecture. For any , , , and as above, the solution set is not aperiodic.
For , let . A coloring is rainbow on a set when all elements of that set receive distinct colors. Rainbow-coloring conjecture. For ever…
Let be the unit distance graph of , and let be the unit rhombus defined in the source. A coloring is a map…
The optimal block-coloring conjecture. For ,
Partial coloring extension conjecture. Then can be extended to a -coloring if and only if consists of aperiodic points.
Hyper aperiodic extension conjecture. Then can be extended to a hyper aperiodic point in if and only if consists of aperiodic points.
The finite-or-continuum conjecture. For every nonregular finite system of linear homogeneous equations, either is finite or…
The multiplicative decomposition conjecture. If , , and are integers, , , , and , then
The uniqueness conjecture. For , is the only -coloring, up to isomorphism, of the nonzero rational numbers without a monochromatic solution to .
Let be an alternating knot diagram with no nugatory crossings. The determinant of is the order of its first homology group of the double branched cove…