The Formal Inverse of the Period-Doubling Sequence
Narad Rampersad, Manon Stipulanti

TL;DR
This paper investigates the properties of the formal inverse of the period-doubling sequence's generating function over finite fields, revealing its automaticity and non-regularity of certain index sequences, and compares it to other well-known sequences.
Contribution
It provides the first detailed analysis of the formal inverse of the period-doubling sequence, including recurrence relations, automaton construction, and regularity properties of related index sequences.
Findings
The inverse sequence is 2-automatic and generated by a finite automaton.
The index sequence where the inverse takes value 0 is not k-regular for any k≥2.
The index sequence where the inverse takes value 1 is not k-regular and relates to Fibonacci numbers.
Abstract
If is a prime number, consider a -automatic sequence , and let be its generating function. Assume that there exists a formal power series which is the compositional inverse of , i.e., . The problem investigated in this paper is to study the properties of the sequence . 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 (resp., ) is not -regular for any . Secondly, we give recurrence relations for its formal inverse, then we easily show that it is…
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
Topicssemigroups and automata theory · Mathematical Dynamics and Fractals · Advanced Combinatorial Mathematics
