Rudin-Shapiro Sums Via Automata Theory and Logic

2023/02/01 by Rampersad, Narad, Shallit, Jeffrey · 2 citations
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2302.00405

Abstract

We show how to obtain, via a unified framework provided by logic and automata theory, many classical results of Brillhart and Morton on Rudin-Shapiro sums. The techniques also facilitate easy proofs for new results.

Cited by

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

Related

• Proving properties of some greedily-defined integer recurrences via automata theory
• Sums with convolution of Dirichlet characters
• Beyond Shapiro's problem: from cyclic sums to "graphic'' sums
• The Target Discounted-Sum Problem
• Sur les occurrences des mots dans les nombres premiers