Novel structures in Stanley sequences

DOI10.1016/J.DISC.2015.10.017MaRDI QIDQ898128zbMATH OpenOpenAlexFDO

Authors Richard Moy, David Rolnick

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

zbMATH Keywords

arithmetic progressionRoth's theorem3-free setStanley sequenceternary representation

Mathematics Subject Classification ID

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

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 $p$-free sequences, where $p$ is any odd prime.

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

• scientific article; zbMATH DE number 3675978 (Why is no real title available?)
• A Nonaveraging Set of Integers With a Large Sum of Reciprocals
• A note on Elkin's improvement of Behrend's construction
• A note on maximal progression-free sets
• Finding large 3-free sets. I. The small \(n\) case
• Greedy algorithm, arithmetic progressions, subset sums and divisibility
• Integer Sets Containing No Arithmetic Progressions
• On Certain Sets of Integers
• On Roth's theorem on progressions
• On Sequences of Integers with No 4, or No 5 Numbers in Arithmetical Progression
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On k-Free Sequences of Integers
• On sets without k-term arithmetic progression
• On the growth of Stanley sequences
• On the growth of the counting function of Stanley sequences
• Sequences containing no 3-term arithmetic progressions

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)