Abstract: Let be an infinite word on an alphabet . We denote by the increasing sequence (assumed to be infinite) of all lengths of palindrome prefixes of . In this text, we give an explicit construction of all words such that for any , and study these words. Special examples include characteristic Sturmian words, and more generally standard episturmian words. As an application, we study the values taken by the quantity , and prove that it is minimal (among all non-periodic words) for the Fibonacci word.
Recommendations
Cites work
- scientific article; zbMATH DE number 3871492 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- A palindromic half-line criterion for absence of eigenvalues and applications to substitution Hamiltonians
- Approximation to real numbers by algebraic integers
- Episturmian words and episturmian morphisms
- Episturmian words and some constructions of de Luca and Rauzy
- Exponents of Diophantine approximation and Sturmian continued fractions.
- Limit values of the recurrence quotient of Sturmian sequences
- Nombres algébriques et substitutions
- Palindrome complexity.
- Palindromic prefixes and Diophantine approximation
- Simultaneous approximation to a real number and its square
- Singular continuous spectrum for palindromic Schrödinger operators
- Some combinatorial properties of Sturmian words
- Spectra for approximating a real number and its square.
- Sturmian words: structure, combinatorics, and their arithmetics
Cited in
(28)- Lyndon words and Fibonacci numbers
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- Words with many palindrome pair factors
- Borders, palindrome prefixes, and square prefixes
- Palindromic richness
- Generalized palindromic continued fractions
- A new characteristic property of rich words
- On the ring of approximation triples attached to a class of extremal real numbers
- The sequence of open and closed prefixes of a Sturmian word
- Reversals and palindromes in continued fractions
- A connection between palindromic and factor complexity using return words
- Palindromic prefixes and Diophantine approximation
- Palindromic continued fractions
- On different generalizations of episturmian words
- Prefix palindromic length of the Sierpinski word
- Exponents of Diophantine approximation in dimension 2 for numbers of Sturmian type
- Characteristic morphisms of generalized episturmian words
- Some properties of the \(k\)-bonacci words on infinite alphabet
- On extremal properties of the Fibonacci word
- On \(\theta\)-episturmian words
- On a Family of Morphic Images of Arnoux-Rauzy Words
- Exponents of Diophantine approximation in dimension 2 for a general class of numbers
- Characterizations of Words with Many Periods
- Local symmetry dynamics in one-dimensional aperiodic lattices: a numerical study
- On a Generalization of Standard Episturmian Morphisms
- Greedy palindromic lengths
- A new characteristic property of the palindrome prefixes of a standard Sturmian word
- Episturmian words: a survey
This page was built for publication: Palindromic prefixes and episturmian words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855827)
