Caps and progression-free sets in $\mathbb{Z}_m^n$
Combinatorics
2019-03-21 v1 Number Theory
Abstract
We study progression-free sets in the abelian groups . Let denote the maximal size of a set that does not contain a proper arithmetic progression of length . We give lower bound constructions, which e.g. include that , when is even. When this is of order at least . Moreover, if the progression-free set satisfies a technical condition, which dominates the problem at least in low dimension, then holds. We present a number of new methods which cover lower bounds for several infinite families of parameters , which includes for example: . For we determine the exact values, when , e.g. , and for we determine the exact values, when , e.g. .
Cite
@article{arxiv.1903.08266,
title = {Caps and progression-free sets in $\mathbb{Z}_m^n$},
author = {Christian Elsholtz and Péter Pál Pach},
journal= {arXiv preprint arXiv:1903.08266},
year = {2019}
}