A combinatorial proof of the dense Hindman's theorem
From MaRDI portal
Publication:2275370
DOI10.1016/j.disc.2011.03.006zbMath1229.05010arXiv1002.0347MaRDI QIDQ2275370
Publication date: 8 August 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.0347
05A17: Combinatorial aspects of partitions of integers
05A05: Permutations, words, matrices
05D10: Ramsey theory
Related Items
CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC, A combinatorial proof of a stronger dense Hindman theorem, On the Descriptive Power of Probability Logic, D sets and $\mathbf {IP}$ rich sets in $\mathbb Z$, Ultrafilters in reverse mathematics, ON THE STRENGTH OF TWO RECURRENCE THEOREMS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple proof and some difficult examples for Hindman's theorem
- Algebra in the Stone-Čech compactification. Theory and applications
- Nonstandard methods for upper Banach density problems.
- Finite sums from sequences within cells of a partition of N
- A short proof of Hindman's theorem
- The sumset phenomenon
- Hindman's theorem: an ultrafilter argument in second order arithmetic
- Ultrafilters: Some old and some new results
- Divisible Properties and the Stone-Čech Compactification
- Hindman's theorem, ultrafilters, and reverse mathematics