Finite sums of arithmetic progressions
classification
🧮 math.CO
keywords
finitegivetheoremarithmeticboundscombinatorialgeneralizationhindman
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.