Allouche, Jean-Paul; Peyrière, Jacques; Wen, Zhi-Xiong; Wen, Zhi-Ying Hankel determinants of the Thue-Morse sequence. (English) Zbl 0974.11010 Ann. Inst. Fourier 48, No. 1, 1-27 (1998). Summary: Let \(\varepsilon=(\varepsilon_n)_{n\geq 0}\) be the Thue-Morse sequence, i.e., the sequence defined by the recurrence equations: \[ \varepsilon_0=1, \varepsilon_{2n}=\varepsilon_n, \varepsilon_{2n+1}=1-\varepsilon_n. \] We consider \(\{|{\mathcal E}^p_n|\}_{n\geq 1,p\geq 0}\), the double sequence of Hankel determinants (modulo 2) associated with the Thue-Morse sequence. Together with three other sequences, it obeys a set of sixteen recurrence equations. It is shown to be automatic. Applications are given, namely to combinatorial properties of the Thue-Morse sequence and to the existence of certain Padé approximants of the power series \(\sum_{n\geq 0}(-1)^{\varepsilon_n}x^n\). Cited in 10 ReviewsCited in 28 Documents MSC: 11B85 Automata sequences 68R15 Combinatorics on words 41A21 Padé approximation Keywords:Thue-Morse sequence; period doubling sequence; automatic sequences; Hankel determinants; Padé approximants PDF BibTeX XML Cite \textit{J.-P. Allouche} et al., Ann. Inst. Fourier 48, No. 1, 1--27 (1998; Zbl 0974.11010) Full Text: DOI Numdam EuDML Online Encyclopedia of Integer Sequences: Hankel transform of Thue-Morse related sequence A106400. Number of Apwenian series f_n(z) starting with f_n(0)=1. References: [1] [1] , Automates finis en théorie des nombres, Expo. Math., 5 (1987), 239-266. · Zbl 0641.10041 [2] [2] and , Padé approximants, Encyclopedia of mathematics and its applications, I, II, Cambridge University Press, 1981. · Zbl 0603.30044 [3] [3] , Padé-type approximation and general orthogonal polynomials, Birkhäuser Verlag, 1980. · Zbl 0418.41012 [4] [4] , , and , Suites algébriques, automates et substitutions, Bull. Soc. Math. France, 108 (1980), 401-419. · Zbl 0472.10035 [5] [5] , A proof of transcendence based on functional equations, IBM RC-2041, Yorktown Heights, New York, 1968. [6] [6] , Uniform tag sequences, Math. Systems Theory, 6 (1972), 164-192. · Zbl 0253.02029 [7] [7] , Combinatorial and statistical properties of sequences generated by substitutions, Thesis, Mathematisch Instituut, Katholieke Universiteit van Nijmegen, 1980. [8] [8] , and , Folds!, Math. Intelligencer, 4 (1982), 130-138, 173-181 and 190-195. · Zbl 0493.10001 [9] [9] , Substitution minimal sets, Trans. Amer. Math. Soc., 109 (1963), 467-491. · Zbl 0121.18002 [10] [10] , Recurrent geodesic on a surface of negative curvature, Trans. Amer. Math. Soc., 22 (1921), 84-100. · JFM 48.0786.06 [11] [11] , Substitution dynamical systems — Spectral analysis, Lecture Notes in Math., 1294, Springer-Verlag (1987). · Zbl 0642.28013 [12] [12] , Suites automatiques à multi-indices et algébricité, C.R. Acad. Sci. Paris, Série I, 305 (1987), 501-504. · Zbl 0628.10007 [13] [13] , Suites automatiques à multi-indices, Séminaire de Théorie des Nombres de Bordeaux, Exposé 4, (1986-1987), 4-01-4-27; followed by an appendix by J. Shallit, 4-29A-4-36A. · Zbl 0653.10049 [14] [14] , Über unendliche Zeichenreihen, Norske vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana, 7 (1906), 1-22. · JFM 39.0283.01 [15] [15] , Über die gegenseitige Lage gleicher Teile gewisse Zeichenreihen, Norske vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana, 1 (1912), 1-67. · JFM 44.0462.01 [16] [16] and , The sequences of substitutions and related topics, Adv. Math. China, 3 (1989), 123-145. · Zbl 0694.10006 [17] [17] and , Mots infinis et produits de matrices à coefficients polynomiaux, RAIRO, Theoretical Informatics and Applications, 26 (1992), 319-343. · Zbl 0758.11016 [18] [18] and , Some studies on the (p,q)-type sequences, Theoret. Comput. Sci., 94 (1992), 373-393. · Zbl 0758.11017 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.