Stanley sequences with odd character

DOI10.4310/JOC.2018.V9.N4.A2zbMATH Open1448.11027arXiv1707.02037OpenAlexW2964226312WikidataQ128835923 ScholiaQ128835923MaRDI QIDQ1630693FDOQ1630693

Authors: Richard Moy 

Publication date: 10 December 2018

Published in: Journal of Combinatorics (Search for Journal in Brave)

Abstract: Given a set of integers containing no 3-term arithmetic progressions, one constructs a Stanley sequence by choosing integers greedily without forming such a progression. Independent Stanley sequences are a "well-structured" class of Stanley sequences with two main parameters: the character $lambda(A)$ and the repeat factor $ho(A)$. Rolnick conjectured that for every $$, there exists an independent Stanley sequence $S(A)$ such that $lambda(A)=lambda$. This paper demonstrates that $lambda(A)otin1,3,5,9,11,15$ for any independent Stanley sequence $S(A)$.

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

Recommendations

• Characters of independent Stanley sequences
• Novel structures in Stanley sequences
• On the growth of Stanley sequences
• On the classification of Stanley sequences
• On the growth of the counting function of Stanley sequences

zbMATH Keywords

arithmetic progressionStanley sequence\(3\)-free set

Mathematics Subject Classification ID

Arithmetic progressions (11B25)

Cited In (4)

• Two classes of modular \(p\)-Stanley sequences
• Very odd sequences
• On the classification of Stanley sequences
• On the growth of the counting function of Stanley sequences

This page was built for publication: Stanley sequences with odd character

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1630693)