Novel structures in Stanley sequences
From MaRDI portal
Publication:898128
DOI10.1016/J.DISC.2015.10.017zbMATH Open1356.11008arXiv1502.06013OpenAlexW2964237888MaRDI QIDQ898128FDOQ898128
Authors: Richard Moy, David Rolnick 
Publication date: 8 December 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley sequences. First, we characterize well-structured Stanley sequences as solutions to constraints in modular arithmetic, defining the modular Stanley sequences. Second, we introduce the basic Stanley sequences, where elements arise as the sums of subsets of a basis sequence, which in the simplest case is the powers of 3. Applications of our results include the construction of Stanley sequences with arbitrarily large gaps between terms, answering a weak version of a problem by ErdH{o}s et al. Finally, we generalize many results about Stanley sequences to -free sequences, where is any odd prime.
Full work available at URL: https://arxiv.org/abs/1502.06013
Recommendations
- On the classification of Stanley sequences
- On generalized Stanley sequences
- On the growth of Stanley sequences
- ON A NEW CLASS OF SEQUENCES
- On the counting function of Stanley sequences
- Characters of independent Stanley sequences
- Construction of Sturmian sequences
- Some new Smarandache sequences
- New approach to nonrepetitive sequences
- scientific article; zbMATH DE number 503192
Cites Work
- Title not available (Why is that?)
- Sequences containing no 3-term arithmetic progressions
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Greedy algorithm, arithmetic progressions, subset sums and divisibility
- A note on maximal progression-free sets
- On the growth of the counting function of Stanley sequences
- On Roth's theorem on progressions
- A note on Elkin's improvement of Behrend's construction
- Integer Sets Containing No Arithmetic Progressions
- On sets without \(k\)-term arithmetic progression
- On k-Free Sequences of Integers
- Finding large 3-free sets. I. The small \(n\) case
- On the growth of Stanley sequences
- A Nonaveraging Set of Integers With a Large Sum of Reciprocals
- On Sequences of Integers with No 4, or No 5 Numbers in Arithmetical Progression
Cited In (7)
- Two classes of modular \(p\)-Stanley sequences
- Stanley sequences with odd character
- On the counting function of Stanley sequences
- On the classification of Stanley sequences
- On the growth of the counting function of Stanley sequences
- Characters of independent Stanley sequences
- On \(\text{AP}_{3}\)-covering sequences
This page was built for publication: Novel structures in Stanley sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898128)
