On the growth of Stanley sequences

DOI10.1016/j.disc.2015.04.006zbMath1372.11012arXiv1408.4710OpenAlexW1721981759MaRDI QIDQ2352057

Praveen S. Venkataramana, David Rolnick

Publication date: 29 June 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.4710

zbMATH Keywords

greedy algorithmRoth's theoremarithmetic progression3-free setStanley sequence

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Arithmetic progressions (11B25)

Related Items (2)

Novel structures in Stanley sequences ⋮ Characters of independent Stanley sequences

Cites Work

• On the growth of the counting function of Stanley sequences
• On Roth's theorem on progressions
• Greedy algorithm, arithmetic progressions, subset sums and divisibility
• A note on maximal progression-free sets
• On Certain Sets of Integers

This page was built for publication: On the growth of Stanley sequences