A simple proof and some difficult examples for Hindman's theorem
From MaRDI portal
Publication:424579
DOI10.1215/00294527-1626518zbMATH Open1253.03033arXiv0906.3885OpenAlexW2962863029MaRDI QIDQ424579FDOQ424579
Authors: Henry Towsner 
Publication date: 1 June 2012
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Abstract: We give a short, explicit proof of Hindman's Theorem that in every finite coloring of the integers, there is an infinite set all of whose finite sums have the same color. We give several exampls of colorings of the integers which do not have computable witnesses to Hindman's Theorem.
Full work available at URL: https://arxiv.org/abs/0906.3885
Recommendations
- A simple proof of a theorem of Hajdu-Jarden-Narkiewicz
- A simple proof of the Hilton-Milner theorem
- A Very Simple and Elementary Proof of a Theorem of Ingelstam
- A Simple Proof of the Siebeck–Marden Theorem
- A simpler proof of a theorem of Coven and Hedlund
- scientific article
- scientific article; zbMATH DE number 3946364
- Publication:4886218
- A simple proof of Kharitonov's theorem
Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35)
Cites Work
- Algebra in the Stone-Čech compactification: theory and applications
- Finite sums from sequences within cells of a partition of N
- Subsystems of second order arithmetic
- Ultrafilters: Some old and some new results
- Title not available (Why is that?)
- A short proof of Hindman's theorem
- Hindman's theorem: an ultrafilter argument in second order arithmetic
- Algebra in the Stone-Čech compactification and its applications to Ramsey theory
Cited In (11)
- ``Weak yet strong restrictions of Hindman's finite sums theorem
- Effectiveness of Hindman’s Theorem for Bounded Sums
- Hindman's theorem is only a countable phenomenon
- Title not available (Why is that?)
- A combinatorial proof of the dense Hindman's theorem
- Strong failures of higher analogs of Hindman's theorem
- Transfinite approximation of Hindman's theorem
- An Application of Hindman's Theorem to a Problem on Communication Complexity
- Hindman's coloring theorem in arbitrary semigroups
- ON THE STRENGTH OF TWO RECURRENCE THEOREMS
- Title not available (Why is that?)
This page was built for publication: A simple proof and some difficult examples for Hindman's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424579)
