A note on Hindman-type theorems for uncountable cardinals
From MaRDI portal
Publication:1732799
DOI10.1007/S11083-018-9452-9zbMath1441.03034arXiv1703.06706OpenAlexW2737409423MaRDI QIDQ1732799
Publication date: 25 March 2019
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.06706
Ramsey's theoremHindman's theoremfinite sumsErdős-Rado theoremuncountable cardinalsVan der Waerden theoremfinite coloringinfinite combinatoris
Related Items (4)
Finiteness classes arising from Ramsey-theoretic statements in set theory without choice ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial set theory: Partition relations for cardinals
- Pairwise sums in colourings of the reals
- A certain 2-coloring of the reals
- Ramsey methods in analysis
- A Ramsey statement for infinite groups
- Finite sums from sequences within cells of a partition of N
- A short proof of Hindman's theorem
- Hindman's theorem is only a countable phenomenon
- “Weak yet strong” restrictions of Hindman’s Finite Sums Theorem
- Strong failures of higher analogs of Hindman’s theorem
This page was built for publication: A note on Hindman-type theorems for uncountable cardinals