Finite sums of arithmetic progressions
Combinatorics
2019-05-07 v4
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.
Cite
@article{arxiv.1902.09916,
title = {Finite sums of arithmetic progressions},
author = {Shahram Mohsenipour},
journal= {arXiv preprint arXiv:1902.09916},
year = {2019}
}
Comments
Revised and updated