arXiv · 1101.0022
On the Growth of the Counting Function of Stanley Sequences
Abstract
Given a finite set of nonnegative integers A with no 3-term arithmetic progressions, the Stanley sequence generated by A, denoted S(A), is the infinite set created by beginning with A and then greedily including strictly larger integers which do not introduce a 3-term arithmetic progressions in S(A). Erdos et al. asked whether the counting function, S(A,x), of a Stanley sequence S(A) satisfies S(A,x)>x^{1/2-ε} for every ε>0 and x>x_0(ε,A). In this paper we answer this question in the affirmative; in fact, we prove the slightly stronger result that S(A,x)\geq (\sqrt{2}-ε)\sqrt{x} for x\geq x_0(ε,A).
Explore related subjects
Keep this discovery
Richard A. Moy. 2012-02-03. On the Growth of the Counting Function of Stanley Sequences. https://doi.org/10.1016/j.disc.2010.12.019
Cite the original work for its findings. Save a collection to share your selection of sources.