Some extremal properties of the Fibonacci word

DOI10.1142/S0218196713400055zbMATH Open1269.68075arXiv1209.3927OpenAlexW2963357729MaRDI QIDQ2842016FDOQ2842016

Aldo De Luca

Publication date: 30 July 2013

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Abstract: We prove that the Fibonacci word $f$ satisfies among all characteristic Sturmian words, three interesting extremal properties. The first concerns the length and the second the minimal period of its palindromic prefixes. Each of these two properties characterizes $f$ up to a renaming of its letters. A third property concerns the number of occurrences of the letter $b$ in its palindromic prefixes. It characterizes uniquely $f$ among all characteristic Sturmian words having the prefix $abaa$.

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

zbMATH Keywords

continuantsFibonacci wordSturmian wordscentral wordsstandard wordscharacteristic wordsChristoffel words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Certain words on the real projective line
• Sturmian words: structure, combinatorics, and their arithmetics
• Sturmian words, Lyndon words and trees
• Episturmian words and some constructions of de Luca and Rauzy
• Periodicity and the golden ratio
• Special factors, periodicity, and an application to Sturmian words
• Sturmian and Episturmian Words
• Title not available (Why is that?)
• Some combinatorial properties of Sturmian words
• A combinatorial property of the Fibonacci words
• On an involution of Christoffel words and Sturmian morphisms
• Pseudopalindrome closure operators in free monoids
• On extremal properties of the Fibonacci word
• A palindromization map for the free group
• Harmonic and gold Sturmian words
• A standard correspondence on epicentral words
• Episturmian morphisms and a Galois theorem on continued fractions
• Involutions of epicentral words
• A generalized palindromization map in free monoids

Cited In (9)

• On the Complexity of the Generalized Fibonacci Words
• Abelian periods of factors of Sturmian words
• The repetition threshold of episturmian sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• The sequence of open and closed prefixes of a Sturmian word
• Sturmian words and the Stern sequence
• A property of Fibonacci words
• More properties of the Fibonacci word on an infinite alphabet

This page was built for publication: Some extremal properties of the Fibonacci word

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