Mathematics – Combinatorics
Scientific paper
2005-01-24
Journal of Combinatorial Theory, Series A, 113.7 (2006), 1281-1304
Mathematics
Combinatorics
27 pages; many minor changes; to appear in J. Comb. Th. Series A
Scientific paper
Let $w$ be an infinite word on an alphabet $A$. We denote by $(n_i)_{i \geq 1}$ the increasing sequence (assumed to be infinite) of all lengths of palindrome prefixes of $w$. In this text, we give an explicit construction of all words $w$ such that $n_{i+1} \leq 2 n_i + 1$ for any $i$, 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 $\limsup n_{i+1}/n_i$, and prove that it is minimal (among all non-periodic words) for the Fibonacci word.
No associations
LandOfFree
Palindromic Prefixes and Episturmian Words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Palindromic Prefixes and Episturmian Words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Palindromic Prefixes and Episturmian Words will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-312870