|
This article is cited in 2 scientific papers (total in 2 papers)
Maximal Subsets Free of Arithmetic Progressions in Arbitrary Sets
A. S. Semchenkov Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
Abstract:
The problem of determining the maximum cardinality of a subset containing no arithmetic progressions of length $k$ in a given set of size $n$ is considered. It is proved that it is sufficient, in a certain sense, to consider the interval $[1,\dots,n]$. The study continues the work of Komlós, Sulyok, and Szemerédi.
Keywords:
additive combinatorics, combinatorial number theory.
Received: 31.05.2016 Revised: 17.08.2016
Citation:
A. S. Semchenkov, “Maximal Subsets Free of Arithmetic Progressions in Arbitrary Sets”, Mat. Zametki, 102:3 (2017), 436–444; Math. Notes, 102:3 (2017), 396–402
Linking options:
https://www.mathnet.ru/eng/mzm11248https://doi.org/10.4213/mzm11248 https://www.mathnet.ru/eng/mzm/v102/i3/p436
|
|