7 research outputs found

    On formal inverse of the Prouhet-Thue-Morse sequence

    Full text link
    Let pp be a prime number and consider a pp-automatic sequence u=(un)n∈N{\bf u}=(u_{n})_{n\in\N} and its generating function U(X)=βˆ‘n=0∞unXn∈Fp[[X]]U(X)=\sum_{n=0}^{\infty}u_{n}X^{n}\in\mathbb{F}_{p}[[X]]. Moreover, let us suppose that u0=0u_{0}=0 and u1β‰ 0u_{1}\neq 0 and consider the formal power series V∈Fp[[X]]V\in\mathbb{F}_{p}[[X]] which is a compositional inverse of U(X)U(X), i.e., U(V(X))=V(U(X))=XU(V(X))=V(U(X))=X. In this note we initiate the study of arithmetic properties of the sequence of coefficients of the power series V(X)V(X). We are mainly interested in the case when un=tnu_{n}=t_{n}, where tn=s2(n)(mod2)t_{n}=s_{2}(n)\pmod{2} and t=(tn)n∈N{\bf t}=(t_{n})_{n\in\N} is the Prouhet-Thue-Morse sequence defined on the two letter alphabet {0,1}\{0,1\}. More precisely, we study the sequence c=(cn)n∈N{\bf c}=(c_{n})_{n\in\N} which is the sequence of coefficients of the compositional inverse of the generating function of the sequence t{\bf t}. This sequence is clearly 2-automatic. We describe the sequence a{\bf a} characterizing solutions of the equation cn=1c_{n}=1. In particular, we prove that the sequence a{\bf a} is 2-regular. We also prove that an increasing sequence characterizing solutions of the equation cn=0c_{n}=0 is not kk-regular for any kk. Moreover, we present a result concerning some density properties of a sequence related to a{\bf a}.Comment: 16 pages; revised version will appear in Discrete Mathematic
    corecore