Complementary symmetric Rote sequences: the critical exponent and the recurrence function
From MaRDI portal
Abstract: We determine the critical exponent and the recurrence function of complementary symmetric Rote sequences. The formulae are expressed in terms of the continued fraction expansions associated with the S-adic representations of the corresponding standard Sturmian sequences. The results are based on a thorough study of return words to bispecial factors of Sturmian sequences. Using the formula for the critical exponent, we describe all complementary symmetric Rote sequences with the critical exponent less than or equal to 3, and we show that there are uncountably many complementary symmetric Rote sequences with the critical exponent less than the critical exponent of the Fibonacci sequence. Our study is motivated by a~conjecture on sequences rich in palindromes formulated by Baranwal and Shallit. Its recent solution by Curie, Mol, and Rampersad uses two particular complementary symmetric Rote sequences.
Recommendations
Cites work
- A characterization of substitutive sequences using return words
- Continued fractions.
- Critical exponent of infinite balanced words via the Pell number system
- Critical exponents of infinite balanced words
- Derived sequences of complementary symmetric Rote sequences
- Episturmian words and episturmian morphisms
- Episturmian words and some constructions of de Luca and Rauzy
- Fixed points of Sturmian morphisms and their derivated words
- Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- Languages invariant under more symmetries: overlapping factors versus palindromic richness
- On the critical exponent of generalized Thue-Morse words
- Palindromes and Sturmian words
- Palindromic complexity of codings of rotations
- Recurrence functions of Arnoux-Rauzy sequences, and answer to a question of Morse and Hedlund
- Repetitions in infinite palindrome-rich words
- Repetitions in the Fibonacci infinite word
- Sequences with subword complexity \(2n\)
- Sturmian jungle (or garden?) On multiliteral alphabets
- Symbolic Dynamics II. Sturmian Trajectories
- The index of Sturmian sequences
- The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)
Cited in
(12)- On balanced sequences and their critical exponent
- Computation of critical exponent in balanced sequences
- Ostrowski-automatic sequences: theory and applications
- On balanced sequences and their asymptotic critical exponent
- On minimal critical exponent of balanced sequences
- Derived sequences of complementary symmetric Rote sequences
- Asymptotic repetitive threshold of balanced sequences
- An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
- Antisquares and critical exponents
- Complement avoidance in binary words
- Low complexity binary words avoiding (5/2)^+-powers
- Words with factor complexity 2n+1 and minimal critical exponent
This page was built for publication: Complementary symmetric Rote sequences: the critical exponent and the recurrence function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386617)
