Strong failures of higher analogs of Hindman's theorem
David Fern\'andez-Bret\'on, Assaf Rinot

TL;DR
This paper demonstrates that higher analogs of Hindman's theorem fail in uncountable settings, providing explicit counterexamples and showing the limits of extending Hindman's combinatorial properties to larger cardinalities.
Contribution
The authors construct strong counterexamples to uncountable analogs of Hindman's theorem, revealing fundamental limitations in extending these combinatorial principles.
Findings
Existence of colorings with no uncountable monochromatic sumsets
Failure of uncountable Hindman-type theorems in Abelian groups
Consistency results for the validity of certain colorings at large cardinals
Abstract
We show that various analogs of Hindman's Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1: There exists a colouring , such that for every with , and every colour , there are two distinct elements of for which . This forms a simultaneous generalization of a theorem of Hindman, Leader and Strauss and a theorem of Galvin and Shelah. Theorem 2: For every Abelian group , there exists a colouring such that for every uncountable , and every colour , for some large enough integer , there are pairwise distinct elements of such that . In addition, it is consistent that the preceding statement remains valid even after…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
