Rarefied Thue-Morse Sums Via Automata Theory and Logic

2023/02/18 by Jeffrey Shallit, Shallit, Jeffrey · 2 citations
Computer Science · Mathematics · #Advanced Mathematical Identities #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Number Theory (math.NT) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2302.09436

openalex publication_date 2023/02/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let t(n) denote the number of 1-bits in the base-2 representation of n, taken modulo 2. We show how to prove the classic conjecture of Leo Moser, on the rarefied sum ∑_0≤ i

Cited by

• A Generalized Digit Map: Periodicity, Prouhet-Tarry-Escott Solutions, and Summation Identities
• Self-Verifying Predicates in Büchi Arithmetic

Related

• Thue-Morse at Multiples of an Integer
• Minimal automaton for multiplying and translating the Thue-Morse set
• Thue--Morse along the sequence of cubes
• State complexity of the multiples of the Thue-Morse set
• Gaps in the Thue--Morse word