The Adjacent Hindman’s Theorem for uncountable groups

DOI10.4064/CM9095-4-2023arXiv2008.05821OpenAlexW4383425205MaRDI QIDQ6086117

David J. Fernández Bretón, Lorenzo Carlucci

Publication date: 9 November 2023

Published in: Colloquium Mathematicum (Search for Journal in Brave)

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

zbMATH Keywords

additive combinatoricspartition relationRamsey-type theoremErdős-Rado theoremsemigroup colourings

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10) Other combinatorial set theory (03E05) Partition relations (03E02) Ordinal and cardinal numbers (03E10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Every strongly summable ultrafilter on \(\bigoplus \mathbb Z_{2}\) is sparse
• Combinatorial set theory: Partition relations for cardinals
• Ultrafilters on Abelian groups close to being Ramsey ultrafilters
• Pairwise sums in colourings of the reals
• A certain 2-coloring of the reals
• A note on Hindman-type theorems for uncountable cardinals
• A weak variant of Hindman's theorem stronger than Hilbert's theorem
• A Ramsey statement for infinite groups
• Finite sums from sequences within cells of a partition of N
• Restrictions of Hindman's theorem: an overview
• Hindman's theorem is only a countable phenomenon
• Hindman's coloring theorem in arbitrary semigroups
• Hindman-like theorems with uncountably many colours and finite monochromatic sets
• Strong failures of higher analogs of Hindman’s theorem

This page was built for publication: The Adjacent Hindman’s Theorem for uncountable groups