A combinatorial proof of a stronger dense Hindman theorem

DOI10.4064/CM8106-12-2019MaRDI QIDQ5037757zbMATH OpenOpenAlexFDO

Authors Randall Mccutcheon

Publication date 4 March 2022

Published in Colloquium Mathematicum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4064/cm8106-12-2019

zbMATH Keywords

D-setfilterHindman's theoremultrafilter

Mathematics Subject Classification ID

Ultraproducts and related constructions (03C20) Ramsey theory (05D10)

Recommendations

• A combinatorial proof of the dense Hindman's theorem
• Hindman's theorem: an ultrafilter argument in second order arithmetic
• A density version of the Hales-Jewett theorem
• Hindman's theorem, ultrafilters, and reverse mathematics
• scientific article; zbMATH DE number 4031668

Cites work

• A combinatorial proof of the dense Hindman's theorem
• Algebra in the Stone-Čech compactification: theory and applications
• D sets and IP rich sets in \(\mathbb {Z}\)
• Finite sums from sequences within cells of a partition of N
• scientific article; zbMATH DE number 3719449 (Why is no real title available?)
• Large sets of integers and hierarchy of mixing properties of measure preserving systems
• Sets of large values of correlation functions for polynomial cubic configurations
• Solvability of Rado systems in \(D\)-sets
• The Existence of Almost Translation Invariant Ultrafilters on Any Semigroup

Cited in

(5)

• A weak variant of Hindman's theorem stronger than Hilbert's theorem
• Iterated combinatorial density theorems
• A combinatorial proof of the dense Hindman's theorem
• A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane
• Combinational proof for a theorem concerning the upper Banach density

This page was built for publication: A combinatorial proof of a stronger dense Hindman theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5037757)