A short proof of Hindman's theorem

DOI10.1016/0097-3165(74)90103-4zbMath0289.05009OpenAlexW1996285409MaRDI QIDQ1846875

James E. Baumgartner

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(74)90103-4

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05)

Related Items (38)

Using Ultrafilters to Prove Ramsey-type Theorems ⋮ Independent finite sums for \(K_ m\)-free graphs ⋮ Ramsey ultrafilters and the reaping number - Con(\({\mathfrak r}<{\mathfrak u}\)) ⋮ Partitions and Sums and Products of Integers ⋮ Canonical forms of Borel functions on the Milliken space ⋮ Additive and Multiplicative Ramsey Theorems in ℕ – Some Elementary Results ⋮ Finiteness classes arising from Ramsey-theoretic statements in set theory without choice ⋮ In memoriam: James Earl Baumgartner (1943--2011) ⋮ Hindman's theorem is only a countable phenomenon ⋮ Partitions and sums of integers with repetition ⋮ Sparse generalised polynomials ⋮ On some variations of coloring problems of infinite words ⋮ Some combinatorially defined subsets of \(\beta \mathbb N\) and their relation to the idempotents ⋮ Über Partitionen endlicher Teilmengen ⋮ Hindman's theorem and choice ⋮ Sumsets contained in infinite sets of integers ⋮ A simple proof and some difficult examples for Hindman's theorem ⋮ Finite forms of Gowers' theorem on the oscillation stability of \(C_0^*\) ⋮ Effectiveness of Hindman’s Theorem for Bounded Sums ⋮ Coloring Problems for Infinite Words ⋮ A note on Hindman-type theorems for uncountable cardinals ⋮ Matrices of completely Ramsey sets with infinitely many rows ⋮ A Baire-type theorem for cardinals ⋮ Transfinite approximation of Hindman's theorem ⋮ A forcing notion related to Hindman's theorem ⋮ Ultrafilters: Some old and some new results ⋮ Schreier sets in Ramsey theory ⋮ Ramsey's theorem with sums or unions ⋮ Hindman spaces ⋮ A canonical partition relation for finite subsets of \(\omega\) ⋮ A combinatorial proof of the dense Hindman's theorem ⋮ STABLE ORDERED UNION ULTRAFILTERS AND cov ⋮ Block combinatorics ⋮ Fermat’s Last Theorem Implies Euclid’s Infinitude of Primes ⋮ Hindman's theorem: an ultrafilter argument in second order arithmetic ⋮ The Hales-Jewett theorem and possible generalizations ⋮ On Strongly Summable Ultrafilters and Union Ultrafilters ⋮ The mathematics of Bruce Rothschild

Cites Work

• Finite sums from sequences within cells of a partition of N

This page was built for publication: A short proof of Hindman's theorem