arXiv:0812.1314 [math.CO]AbstractReferencesReviewsResources
Equations resolving a conjecture of Rado on partition regularity
Boris Alexeev, Jacob Tsimerman
Published 2008-12-08, updated 2009-01-25Version 2
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive integer k, there exists a linear equation that is (k-1)-regular but not k-regular. We prove this conjecture by showing that the equation $\sum_{i=1}^{k-1} \frac{2^i}{2^i-1} x_i = (-1 + \sum_{i=1}^{k-1} \frac{2^i}{2^i-1}) x_0$ has this property. This conjecture is part of problem E14 in Richard K. Guy's book "Unsolved problems in number theory", where it is attributed to Rado's 1933 thesis, "Studien zur Kombinatorik".
Comments: 2 pages, no figures. The replaced version (v2) differs from the original (v1) only in exposition
Journal: Journal of Combinatorial Theory, Series A 117 (2010), no. 7, 1008-1010
Categories: math.CO
Subjects: 05D10
Keywords: partition regularity, conjecture, equations resolving, linear equation, studien zur kombinatorik
Tags: journal article
Related articles: Most relevant | Search more
arXiv:1012.2545 [math.CO] (Published 2010-12-12)
Proof of Andrews' conjecture on a_4φ_3 summation
arXiv:math/0508537 [math.CO] (Published 2005-08-26)
On a conjecture of Widom
arXiv:math/0610977 [math.CO] (Published 2006-10-31)
New results related to a conjecture of Manickam and Singhi