A combinatorial proof of a stronger dense Hindman theorem

DOI10.4064/CM8106-12-2019zbMath1483.05195OpenAlexW3025974891MaRDI QIDQ5037757

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

filterultrafilterHindman's theoremD-set

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Solvability of Rado systems in \(D\)-sets
• Algebra in the Stone-Čech compactification: theory and applications
• Finite sums from sequences within cells of a partition of N
• A combinatorial proof of the dense Hindman's theorem
• D sets and $\mathbf {IP}$ rich sets in $\mathbb Z$
• The Existence of Almost Translation Invariant Ultrafilters on Any Semigroup
• Sets of large values of correlation functions for polynomial cubic configurations
• Large sets of integers and hierarchy of mixing properties of measure preserving systems

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