Hindman-like theorems with uncountably many colours and finite monochromatic sets

DOI10.1090/PROC/14649MaRDI QIDQ5111520zbMATH OpenOpenAlexWikidataFDO

Authors David J. Fernández-Bretón, Sung Hyup Lee

Publication date 27 May 2020

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.09179

zbMATH Keywords

Ramsey theoryHindman's theoremset theoryabelian groupsuncountable cardinalscombinatorial set theory

Mathematics Subject Classification ID

Partition relations (03E02) Other combinatorial set theory (03E05) Ramsey theory (05D10)

Abstract: A particular case of the Hindman--Galvin--Glazer theorem states that, for every partition of an infinite abelian group $G$ into two cells, there will be an infinite $XsubseteqG$ such that the set of its finite sums $$ is monochromatic. It is known that the same statement is false, in a very strong sense, if one attempts to obtain an uncountable (rather than just infinite) $X$. On the other hand, a recent result of Komj'ath states that, for partitions into uncountably many cells, it is possible to obtain monochromatic sets of the form $mathrmFS(X)$, for $X$ of some prescribed finite size, when working with sufficiently large Boolean groups. In this paper, we provide a generalization of Komj'ath's result, and we show that, in a sense, this generalization is the strongest possible.

Recommendations

• Strong failures of higher analogs of Hindman's theorem
• A note on Hindman-type theorems for uncountable cardinals
• Hindman's theorem is only a countable phenomenon
• Monochromatic infinite sumsets
• Hindman's coloring theorem in arbitrary semigroups

Cites work

• scientific article; zbMATH DE number 426332 (Why is no real title available?)
• scientific article; zbMATH DE number 431995 (Why is no real title available?)
• A Ramsey statement for infinite groups
• A note on Hindman-type theorems for uncountable cardinals
• Algebra in the Stone-Čech compactification. Theory and applications
• Every strongly summable ultrafilter on \(\bigoplus \mathbb Z_{2}\) is sparse
• Finite sums from sequences within cells of a partition of N
• Hindman's theorem is only a countable phenomenon
• Infinite monochromatic sumsets for colourings of the reals
• Monochromatic infinite sumsets
• Partitions of vector spaces over finite fields
• Ramsey's Theorem for n-Parameter Sets
• Set theory. An introduction to independence proofs
• Strong failures of higher analogs of Hindman's theorem

Cited in

(6)

• Some coloring properties for uncountable cardinals
• Hindman's theorem is only a countable phenomenon
• Strong failures of higher analogs of Hindman's theorem
• Hindman's coloring theorem in arbitrary semigroups
• The Adjacent Hindman’s Theorem for uncountable groups
• Coloring finite subsets of uncountable sets

This page was built for publication: Hindman-like theorems with uncountably many colours and finite monochromatic sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111520)