Novel structures in Stanley sequences
From MaRDI portal
Publication:898128
DOI10.1016/j.disc.2015.10.017zbMath1356.11008arXiv1502.06013OpenAlexW2964237888MaRDI QIDQ898128
Publication date: 8 December 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.06013
Related Items
Cites Work
- Unnamed Item
- On sets without \(k\)-term arithmetic progression
- Sequences containing no 3-term arithmetic progressions
- On the growth of the counting function of Stanley sequences
- On Roth's theorem on progressions
- Finding large 3-free sets. I. The small \(n\) case
- Greedy algorithm, arithmetic progressions, subset sums and divisibility
- An improved construction of progression-free sets
- On the growth of Stanley sequences
- A note on maximal progression-free sets
- A Note on Elkin’s Improvement of Behrend’s Construction
- A Nonaveraging Set of Integers With a Large Sum of Reciprocals
- Integer Sets Containing No Arithmetic Progressions
- On Sequences of Integers with No 4, or No 5 Numbers in Arithmetical Progression
- On k-Free Sequences of Integers
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression