The finite-or-continuum conjecture for minimal coloring counts
The finite-or-continuum conjecture for minimal coloring counts
A finite system of linear homogeneous equations over is called nonregular if it is not regular over . Let denote the number of minimal colorings, up to isomorphism, of the nonzero rational numbers.
The finite-or-continuum conjecture. For every nonregular finite system of linear homogeneous equations, either is finite or . In particular, there is no satisfying
The paper establishes examples with finitely many and with minimal colorings, including the equation . Whether countably infinite values can occur remains open.
Sources & referencesView supporting material
Primary source
Boris Alexeev, Jacob Fox and Ron Graham, “On minimal colorings without monochromatic solutions to a linear equation”, arXiv:1009.4234 (2010).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.