An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence

DOI10.1016/J.TCS.2024.114490arXiv2211.11877MaRDI QIDQ6204547FDOQ6204547

L'ubomíra Dvořáková, Edita Pelantová

Publication date: 28 March 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: We colour the Fibonacci sequence by suitable constant gap sequences to provide an upper bound on the asymptotic repetitive threshold of $d$-ary balanced sequences. The bound is attained for $d=2,4$ and $8$ and we conjecture that it happens for infinitely many even $d$'s. Our bound reveals an essential difference in behavior of the repetitive threshold and the asymptotic repetitive threshold of balanced sequences. The repetitive threshold of $d$-ary balanced sequences is known to be at least $1+frac1d-2$ for each $dgeq3$. In contrast, our bound implies that the asymptotic repetitive threshold of $d$-ary balanced sequences is at most $1+fraca{u}^3{2}^{d-3}$ for each $dgeq2$, where $au$ is the golden mean.

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

zbMATH Keywords

Fibonacci sequencereturn wordbalanced sequenceconstant gap sequencebispecial factorasymptotic critical exponentasymptotic repetition threshold

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• A characterization of substitutive sequences using return words
• Episturmian words and some constructions of de Luca and Rauzy
• Special factors, periodicity, and an application to Sturmian words
• Repetitions in the Fibonacci infinite word
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Symbolic Dynamics II. Sturmian Trajectories
• Languages invariant under more symmetries: overlapping factors versus palindromic richness
• On extremal properties of the Fibonacci word
• A characterization of Sturmian words by return words
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Critical exponents of infinite balanced words
• On Dejean's conjecture over large alphabets
• Sur un théorème de Thue
• A proof of Dejean’s conjecture
• Last cases of Dejean's conjecture
• Dejean's conjecture and Sturmian words
• Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta]: n=1,2,\dots \}\)
• Balance properties of Arnoux-Rauzy words
• Well-balanced sequences
• Words derivated from Sturmian words
• On a Class of 2-Balanced Sequences
• The repetition threshold for binary rich words
• Critical exponent of infinite balanced words via the Pell number system
• On balanced sequences and their critical exponent
• On minimal critical exponent of balanced sequences
• Complementary symmetric Rote sequences: the critical exponent and the recurrence function
• Generalizations of Sturmian sequences associated with \(\boldsymbol{N}\)-continued fraction algorithms
• Asymptotic repetitive threshold of balanced sequences

Cited In (1)

• The repetition threshold of episturmian sequences

This page was built for publication: An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence

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