Arithmetic progressions in abundance by combinatorial tools
From MaRDI portal
Abstract: Using the algebraic structure of the Stone-Cech compactification of the integers, Furstenberg and Glasner proved that for arbitrary k, every piecewise syndetic set contains a piecewise syndetic set of k-term arithmetic progressions. We present a purely combinatorial argument which allows to derive this result directly from van der Waerden's Theorem.
Recommendations
- Abundance of arithmetic progressions in some combinatorially rich sets by elementary means
- Abundance of progressions in a commutative semigroup by elementary means
- Richness of arithmetic progressions in commutative semigroups
- An algebraic proof of van der Waerden's theorem
- scientific article; zbMATH DE number 1534863
Cites work
Cited in
(11)- Abundance of progressions in a commutative semigroup by elementary means
- Abundance of arithmetic progressions in some combinatorially rich sets by elementary means
- scientific article; zbMATH DE number 1121844 (Why is no real title available?)
- scientific article; zbMATH DE number 7640029 (Why is no real title available?)
- Richness of arithmetic progressions in commutative semigroups
- Some dynamical properties related to polynomials
- Piecewise syndetic sets in \(\mathbb{N}^t\) and \(\mathbb{N}^X\)
- Some negative answers to Bergelson-Hindman's question
- Topological dynamical systems induced by polynomials and combinatorial consequences
- Abundance of arithmetic progressions in CR-sets
- Nilpotent structures in dynamical systems
This page was built for publication: Arithmetic progressions in abundance by combinatorial tools
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648156)
