Equations of the form t(x+a)=t(x) and t(x+a)=1-t(x) for Thue-Morse\n sequence

2009/07/05 by Vladimir Shevelev, Shevelev, Vladimir
Computer Science · Mathematics · #11B83 #Algorithms and Data Compression #Coding theory and cryptography #FOS: Mathematics #Mathematical Dynamics and Fractals #Number Theory (math.NT) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.0907.0880

openalex publication_date 2009/07/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

For every a\≥1 we give a recursion algorithm of building of set of\nsolutions of equations of the form t(x+a)=t(x) and t(x+a)=1-t(x), where\n t(n) is Thue-Morse sequence. We pose an open problem and two conjectures.\n

Citations

• On Connection between the Numbers of Permutations and Full Cycles with\n Some Restrictions on Positions and Up-Down Structure

Related

• Thue, Combinatorics on words, and conjectures inspired by the Thue-Morse sequence
• ϕ-Thue-Morse sequences and infinite products
• Two analogs of Thue-Morse sequence
• A Fibonacci type sequence with Prouhet-Thue-Morse coefficients
• To Symbolic Dynamics Through The Thue-Morse Sequence