Hindman's theorem is only a countable phenomenon
From MaRDI portal
Publication:2413413
DOI10.1007/S11083-016-9419-7zbMath1425.03017arXiv1506.05834OpenAlexW2528652753MaRDI QIDQ2413413
Publication date: 10 April 2018
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.05834
semigroupsabelian groupsHindman's theoremuncountable cardinals\(\Delta\)- system lemmaRamey-type theorem
Commutative semigroups (20M14) Ramsey theory (05D10) Other combinatorial set theory (03E05) Partition relations (03E02)
Related Items (4)
The Adjacent Hindman’s Theorem for uncountable groups ⋮ Hindman-like theorems with uncountably many colours and finite monochromatic sets ⋮ Infinite monochromatic sumsets for colourings of the reals ⋮ A note on Hindman-type theorems for uncountable cardinals
Cites Work
- Unnamed Item
- Every strongly summable ultrafilter on \(\bigoplus \mathbb Z_{2}\) is sparse
- Algebra in the Stone-Čech compactification. Theory and applications
- Idempotents in compact semigroups and Ramsey theory
- Set theory. An introduction to independence proofs
- Some unifying principles in Ramsey theory
- Finite sums from sequences within cells of a partition of N
- A short proof of Hindman's theorem
- Introduction to Ramsey Spaces (AM-174)
- Selective ultrafilters on FIN
- Algebra, selections, and additive Ramsey theory
- Strong failures of higher analogs of Hindman’s theorem
This page was built for publication: Hindman's theorem is only a countable phenomenon