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

DOI10.1090/PROC/14649zbMATH Open1481.03044arXiv1801.09179OpenAlexW2962758793WikidataQ128055668 ScholiaQ128055668MaRDI QIDQ5111520FDOQ5111520

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)

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.

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

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

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)

Cites Work

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

Cited In (4)

• Some coloring properties for uncountable cardinals
• Hindman's theorem is only a countable phenomenon
• 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)