Palindromic Closures and Thue-Morse Substitution for Markoff Numbers

A] AIGNER, M.: Markov’s Theorem and 100 Years of the Uniqueness Conjecture, Springer-Verlag, Berlin, 2013. 10.1007/978-3-319-00888-2Search in Google Scholar

[Be] BERSTEL, J.: Sturmian and episturmian words. In: Algebraic informatics, Springer-Verlag, Berlin, 2007, pp. 23-47.10.1007/978-3-540-75414-5_2Search in Google Scholar

[BS] BERSTEL, J.-S´E´EBOLD, P.: Sturmian words, (M. Lothaire, ed). In: Algebraic Combinatorics on Words, Encyclopedia of Math. and Appl. Vol. 90, Cambridge University Press, 2002. pp. 45-110.Search in Google Scholar

[BLRS] BERSTEL, J.-LAUVE, V.-REUTENAUER, C.-SALIOLA, V.: Combinatorics on Words: Christoffel Words and Repetitions in Words, CRM Monograph series, AMS, 2008.10.1090/crmm/027Search in Google Scholar

[BdLR] BERTHÉ, V.-DE LUCA, A.-REUTENAUER, C.: On an involution of Christoffel words and Sturmian morphisms, European Journal of Combinatorics 29 (2008), 535-553.10.1016/j.ejc.2007.03.001Open DOISearch in Google Scholar

[BPTV] BLONDIN MASS´E, A.-PAQUIN, G.-TREMBLAY, H.-VUILLON, L.: On generalized pseudostandard words over binary alphabets, J. Integer Seq., 16 (2013), no. 2, Article 13.2.1.Search in Google Scholar

[B] BOMBIERI, E.: Continued fractions and the Markoff tree, Expositiones Mathematicae 25 (2007), 187-213.10.1016/j.exmath.2006.10.002Open DOISearch in Google Scholar

[BRS] BUGEAUD, Y.-REUTENAUER, C.-SIKSEK, S.: A Sturmian sequence related to the uniqueness conjecture for Markoff numbers. Theoretical Computer Science, 410 (2009), no. 30-32, 2864-2869.Search in Google Scholar

[C1] COHN, H.: Approach to Markoff’s minimal forms through modular functions Ann. of Math. 61 (1955), 1-12.10.2307/1969618Open DOISearch in Google Scholar

[C2] Markoff’s forms and primitive words, Math, Ann. 196 (1972), 8-22.Search in Google Scholar

[C3] Growth types of Fibonacci and Markoff, 17 (1979), 178-183.Search in Google Scholar

[CF] CUSICK, T. W.-FLAHIVE, V.: The Markoff and Lagrange spectra, AMS, 1989.10.1090/surv/030Search in Google Scholar

[F] FROBENIUS, G.: ¨Uber die Markoffschen Zahlen. Sitzungsberichte der K¨oniglich Preussischen Akademie der Wissenschaften, 26 (1913), 458-487.Search in Google Scholar

[M1] MARKOFF, A. A.: Sur les formes quadratiques binaires ind´efinies, Mathematische Annalen 15, (1879), 381-496.10.1007/BF02086269Search in Google Scholar

[M2] Sur les formes quadratiques binaires ind´efinies (second m´emoire), Math. Anna. 17 (1880), 379-399.10.1007/BF01446234Search in Google Scholar

[L] LOTHAIRE,M. (et al.): Algebraic combinatorics on words. In: Encyclopedia of Mathematics and its Applications, Vol. 90, Cambridge University Press, Cambridge, 2002.10.1017/CBO9781107326019Open DOISearch in Google Scholar

[dL] De LUCA, A. Sturmian words: structure, combinatorics, and their arithmetics, Theoretical Computer Science 183 (1997), 45-82.10.1016/S0304-3975(96)00310-6Search in Google Scholar

[dLDL] de LUCA, A.-De LUCA, A.: Pseudopalindrome closure operators in free monoids, Theor. Comput. Sci. 362 (2006), no. 1-3, 282-300.Search in Google Scholar

[J] JUSTIN, J.: Episturmian morphisms and a Galois theorem on continued fractions, Theoretical Informatics and Applications 39 (2005), no. 1, 207-215.Search in Google Scholar

[P] PROPP, J.: The combinatorics of frieze patterns and Markoff numbers, arXiv: math/0511633v4 (2008), 29-34.Search in Google Scholar

[Re1] REUTENAUER, C.: Christoffel Words and Markoff Triples, Integers 9 (2009), 327-332.10.1515/INTEG.2009.027Search in Google Scholar

[Re2] From Christoffel words to Markoff numbers, (in preparation)Search in Google Scholar

[V] VUILLON, L.: Balanced words Bulletin of the Belgian Mathematical Society, 5 (2003), 787-805.Search in Google Scholar