arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0812.1314math.CO
收藏

解Rado关于分划正则性猜想的方程组

Equations resolving a conjecture of Rado on partition regularity

Boris Alexeev, Jacob Tsimerman

摘要:

一个线性方程L称为k-正则的,如果每个正整数的k-染色都包含L的单色解. Richard Rado证明了对于每一个正整数k,存在一个线性方程是(k-1)-正则的但不是k-正则的.证明了方程$\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$具有这一性质。这个猜想是Richard K. Guy的书“Unsolved problems in数论“,在那里它被归因于Rado的1933年论文,“Kombinatorik”。

英文摘要:

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".

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑