Finite sums of arithmetic progressions
From MaRDI portal
Abstract: We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer's theorem and Hindman's theorem. We also give tower bounds for a finite version of it.
Recommendations
- Publication:3480041
- Combinatorial Proofs of the Polynomial van der Waerden Theorem and the Polynomial Hales-Jewett Theorem
- Quantitative versions of combinatorial partition theorems.
- A Short Proof of van der Waerden's Theorem on Arithmetic Progressions
- Ramsey's theorem for sums, products, and arithmetic progressions
Cites work
- A canonical partition relation for finite subsets of
- A new proof of Szemerédi's theorem
- scientific article; zbMATH DE number 3719449 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- Partitions and sums of (m,p,c)-sets
- Ramsey theory for discrete structures
- Ramsey theory for product spaces
Cited in
(5)
This page was built for publication: Finite sums of arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958943)