An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
From MaRDI portal
Publication:6204547
DOI10.1016/j.tcs.2024.114490arXiv2211.11877MaRDI QIDQ6204547
L'ubomíra Dvořáková, Edita Pelantová
Publication date: 28 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.11877
Fibonacci sequencereturn wordbalanced sequenceconstant gap sequencebispecial factorasymptotic critical exponentasymptotic repetition threshold
Cites Work
- Languages invariant under more symmetries: overlapping factors versus palindromic richness
- Last cases of Dejean's conjecture
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Dejean's conjecture and Sturmian words
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- A characterization of substitutive sequences using return words
- Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta: n=1,2,\dots \}\)]
- Well-balanced sequences
- Special factors, periodicity, and an application to Sturmian words
- On balanced sequences and their critical exponent
- Critical exponent of infinite balanced words via the Pell number system
- Critical exponents of infinite balanced words
- On Dejean's conjecture over large alphabets
- Words derivated from Sturmian words
- Sur un théorème de Thue
- On minimal critical exponent of balanced sequences
- BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS
- A proof of Dejean’s conjecture
- Complementary symmetric Rote sequences: the critical exponent and the recurrence function
- On extremal properties of the Fibonacci word
- Repetitions in the Fibonacci infinite word
- The repetition threshold for binary rich words
- Symbolic Dynamics II. Sturmian Trajectories
- Asymptotic repetitive threshold of balanced sequences
- A characterization of Sturmian words by return words
- Episturmian words and some constructions of de Luca and Rauzy
- Generalizations of Sturmian sequences associated with \(\boldsymbol{N}\)-continued fraction algorithms
- On a Class of 2-Balanced Sequences
