Article
Bounds on the Size of Progression-Free Sets in Zn^m
Authors
Abstract
In this note we give an overview of the currently known best lower and upper
bounds on the size of a subset of \( \mathbb{Z}_m^n \) avoiding \( k \)-term
arithmetic progression. We will focus on the case when the length of the
forbidden progression is \( 3 \). We also formulate some open questions.
Keywords
progression-free sets, cap set problem, polynomial method.
Citation
Pal Pach, P. (2022). Bounds on the size of progression-free sets in zn^m. Uniform Distribution Theory, 17(1), 60–70. https://doi.org/10.2478/UDT-2022-0005
P. Pal Pach, “Bounds on the size of progression-free sets in zn^m,” Uniform Distribution Theory, vol. 17, no. 1, pp. 60–70, 2022, doi: 10.2478/UDT-2022-0005.
Pal Pach P. Bounds on the size of progression-free sets in zn^m. Uniform Distribution Theory. 2022;17(1):60–70. doi:10.2478/UDT-2022-0005.
Pal Pach, P. (2022), ‘Bounds on the size of progression-free sets in zn^m’, Uniform Distribution Theory, 17(1), pp. 60–70. Available at: https://doi.org/10.2478/UDT-2022-0005.
Pal Pach, Peter. “Bounds on the Size of Progression-free Sets in Zn^m.” Uniform Distribution Theory, vol. 17, no. 1, 2022, pp. 60–70. https://doi.org/10.2478/UDT-2022-0005.
Pal Pach, Peter. “Bounds on the Size of Progression-free Sets in Zn^m.” Uniform Distribution Theory 17, no. 1 (2022): 60–70. https://doi.org/10.2478/UDT-2022-0005.
Export citation
Published by: Engineering Journals
