paper

Strong failures of higher analogs of Hindman's theorem

arXiv:1608.01512 · doi:10.1090/tran/7131

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 enlarging the set of colours from to . Theorem 3: Let assert that for every Abelian group of cardinality , there exists a colouring such that for every positive integer , every , and every , there are such that . Then holds for unboundedly many uncountable cardinals , and it is consistent that holds for all regular uncountable cardinals .

Final accepted version. For several of the earlier results that were stated only for regular cardinals, there is now a treatment of the singular cardinal case. Also, a new partition relation for the Real Line was obtained, see Theorem C3

Cited by in corpus (3)