Equations resolving a conjecture of Rado on partition regularity

Abstract

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 Σi=1k-1 2i2i-1 xi = (-1 + Σi=1k-1 2i2i-1) x0 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".

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…