English

The Formal Inverse of the Period-Doubling Sequence

Combinatorics 2018-08-01 v1 Formal Languages and Automata Theory

Abstract

If pp is a prime number, consider a pp-automatic sequence (un)n0(u_n)_{n\ge 0}, and let U(X)=n0unXnFp[[X]]U(X) = \sum_{n\ge 0} u_n X^n \in \mathbb{F}_p[[X]] be its generating function. Assume that there exists a formal power series V(X)=n0vnXnFp[[X]]V(X) = \sum_{n\ge 0} v_n X^n \in \mathbb{F}_p[[X]] which is the compositional inverse of UU, i.e., U(V(X))=X=V(U(X))U(V(X))=X=V(U(X)). The problem investigated in this paper is to study the properties of the sequence (vn)n0(v_n)_{n\ge 0}. The work was first initiated for the Thue-Morse sequence, and more recently the case of two variations of the Baum-Sweet sequence has been treated. In this paper, we deal with the case of the period-doubling sequence. We first show that the sequence of indices at which the period-doubling sequence takes value 00 (resp., 11) is not kk-regular for any k2k\ge 2. Secondly, we give recurrence relations for its formal inverse, then we easily show that it is 22-automatic, and we also provide an automaton that generates it. Thirdly, we study the sequence of indices at which this formal inverse takes value 11, and we show that it is not kk-regular for any k2k\ge 2 by connecting it to the characteristic sequence of Fibonacci numbers. We leave as an open problem the case of the sequence of indices at which this formal inverse takes value 00. We end the paper with a remark on the case of generalized Thue-Morse sequences.

Keywords

Cite

@article{arxiv.1807.11899,
  title  = {The Formal Inverse of the Period-Doubling Sequence},
  author = {Narad Rampersad and Manon Stipulanti},
  journal= {arXiv preprint arXiv:1807.11899},
  year   = {2018}
}

Comments

20 pages