On tt-extensions of the Hankel determinants of certain automatic sequences

In 1998, Allouche, Peyri\`ere, Wen and Wen considered the Thue--Morse sequence, and proved that all the Hankel determinants of the period-doubling sequence are odd integral numbers. We speak of $t$-extension when the entries along the diagonal in the Hankel determinant are all multiplied by~$t$. Then we prove that the $t$-extension of each Hankel determinant of the period-doubling sequence is a polynomial in $t$, whose leading coefficient is the {\it only one} to be an odd integral number. Our proof makes use of the combinatorial set-up developed by Bugeaud and Han, which appears to be very suitable for this study, as the parameter $t$ counts the number of fixed points of a permutation. Finally, we prove that all the $t$-extensions of the Hankel determinants of the regular paperfolding sequence are polynomials in $t$ of degree less than or equal to $3$

Hankel Determinant Calculus for the Thue-Morse and related sequences

The Hankel determinants of certain automatic sequences $f$ 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 $LU$-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 $g$ equal to $f$ modulo $p$ are equal to the Hankel determinants of $f$ modulo $p$. The clue then consists of finding a nice sequence $g$, 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. We also prove that the corresponding Hankel determinants do not vanish when the powers $2^n$ in the infinite product defining the $\pm 1$ Thue--Morse sequence are replaced by $3^n$

The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings

We review the concept of the number wall as an alternative to the traditional linear complexity profile (LCP), and sketch the relationship to other topics such as linear feedback shift-register (LFSR) and context-free Lindenmayer (D0L) sequences. A remarkable ternary analogue of the Thue-Morse sequence is introduced having deficiency 2 modulo 3, and this property verified via the re-interpretation of the number wall as an aperiodic plane tiling