Hankel Determinant Calculus for the Thue-Morse and related sequences
Guo-Niu Han

TL;DR
This paper introduces a novel method for evaluating Hankel determinants of automatic sequences, including Thue-Morse, using modular arithmetic and sequence transformations, simplifying proofs of non-vanishing properties.
Contribution
The paper presents a new approach to compute Hankel determinants of automatic sequences via modular equivalences, enabling closed-form expressions and simplified proofs.
Findings
Hankel determinants of the Thue-Morse sequence are nonzero.
The method simplifies existing proofs of non-vanishing determinants.
Hankel determinants do not vanish when powers are replaced by 3^n.
Abstract
The Hankel determinants of certain automatic sequences are evaluated, based on a calculation modulo a prime number. In most cases, the Hankel determinants of automatic sequences do not have any closed-form expressions; the traditional methods, such as -decompo\-si\-tion and Jacobi continued fraction, cannot be applied directly. Our method is based on a simple idea: the Hankel determinants of each sequence equal to modulo are equal to the Hankel determinants of modulo . The clue then consists of finding a nice sequence , whose Hankel determinants have closed-form expressions. Several examples are presented, including a result saying that the Hankel determinants of the Thue-Morse sequence are nonzero, first proved by Allouche, Peyri\`ere, Wen and Wen using determinant manipulation. The present approach shortens the proof of the latter result significantly.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Advanced Combinatorial Mathematics · Mathematical functions and polynomials
