Palindromic Closures and Thue-Morse Substitution for Markoff Numbers
Open Access
- 20 December 2017
- journal article
- research article
- Published by Walter de Gruyter GmbH in Uniform distribution theory
- Vol. 12 (2) , 25-35
Abstract
We state a new formula to compute the Markoff numbers using iterated palindromic closure and the Thue-Morse substitution. The main theorem shows that for each Markoff number m, there exists a word v ∈ {a, b}∗ such that m − 2 is equal to the length of the iterated palindromic closure of the iterated antipalindromic closure of the word av. This construction gives a new recursive construction of the Markoff numbers by the lengths of the words involved in the palindromic closure. This construction interpolates between the Fibonacci numbers and the Pell numbers.Keywords
This publication has 13 references indexed in Scilit:
- Christoffel Words and Markoff TriplesIntegers, 2009
- Combinatorics on Words2008
- On an involution of Christoffel words and Sturmian morphismsEuropean Journal of Combinatorics, 2008
- Continued fractions and the Markoff treeExpositiones Mathematicae, 2007
- Sturmian and Episturmian Words2007
- Sturmian words: structure, combinatorics, and their arithmeticsTheoretical Computer Science, 1997
- The Markoff and Lagrange Spectra1989
- Approach to Markoff's Minimal Forms Through Modular FunctionsAnnals of Mathematics, 1955
- Sur les formes quadratiques binaires ind finiesMathematische Annalen, 1880
- Sur les formes quadratiques binaires indéfiniesMathematische Annalen, 1879