A simple proof and some difficult examples for Hindman's theorem
From MaRDI portal
(Redirected from Publication:424579)
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.
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; zbMATH DE number 4147865
- scientific article; zbMATH DE number 3946364
- Publication:4886218
- A simple proof of Kharitonov's theorem
Cites work
- scientific article; zbMATH DE number 4063093 (Why is no real title available?)
- A short proof of Hindman's theorem
- Algebra in the Stone-Čech compactification and its applications to Ramsey theory
- Algebra in the Stone-Čech compactification: theory and applications
- Finite sums from sequences within cells of a partition of N
- Hindman's theorem: an ultrafilter argument in second order arithmetic
- Subsystems of second order arithmetic
- Ultrafilters: Some old and some new results
Cited in
(11)- Strong failures of higher analogs of Hindman's theorem
- ``Weak yet strong restrictions of Hindman's finite sums theorem
- Hindman's coloring theorem in arbitrary semigroups
- scientific article; zbMATH DE number 5003594 (Why is no real title available?)
- scientific article; zbMATH DE number 4063093 (Why is no real title available?)
- Transfinite approximation of Hindman's theorem
- A combinatorial proof of the dense Hindman's theorem
- Effectiveness of Hindman’s Theorem for Bounded Sums
- An Application of Hindman's Theorem to a Problem on Communication Complexity
- Hindman's theorem is only a countable phenomenon
- ON THE STRENGTH OF TWO RECURRENCE THEOREMS
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)
