Alweiss's non-partition-regularity conjecture for sums and products over polynomial colorings
Alweiss's non-partition-regularity conjecture for sums and products over polynomial colorings
For , let be the set of polynomials in a countable set of variables with nonnegative integer coefficients, constant term, and degree at most in each variable. A pattern is partition regular over if every finite coloring of contains a monochromatic realization of that pattern.
Alweiss's non-partition-regularity conjecture. There exists such that, for every , the pattern
is not partition regular over .
The statement is presented as essentially asserting that the methods of the paper are necessary for addressing Hindman's conjecture over polynomial colorings. It remains open; even the weaker assertion that Hindman's conjecture is false over is not known.
Sources & referencesView supporting material
Primary source
Ryan Alweiss, “Monochromatic Sums and Products over Q”, arXiv:2307.08901 (2026).
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.