Sequences of integers avoiding 3-term arithmetic progressions
The electronic journal of combinatorics, Tome 19 (2012) no. 1
The optimal length $r(n)$ of a sequence in $[1, n]$ containing no $3$-term arithmetic progression is determined for several new values of $n$ and some results relating to the subadditivity of $r$ are obtained. We also prove a particular case of a conjecture of Szekeres.
DOI :
10.37236/1180
Classification :
11B25, 05D10
Mots-clés : optimal length of a sequence, subadditivity
Mots-clés : optimal length of a sequence, subadditivity
@article{10_37236_1180,
author = {Arun Sharma},
title = {Sequences of integers avoiding 3-term arithmetic progressions},
journal = {The electronic journal of combinatorics},
year = {2012},
volume = {19},
number = {1},
doi = {10.37236/1180},
zbl = {1243.05023},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1180/}
}
Arun Sharma. Sequences of integers avoiding 3-term arithmetic progressions. The electronic journal of combinatorics, Tome 19 (2012) no. 1. doi: 10.37236/1180
Cité par Sources :