Rudin-Shapiro Sums Via Automata Theory and Logic
Narad Rampersad, Jeffrey Shallit

TL;DR
This paper presents a unified logical and automata-theoretic framework to analyze Rudin-Shapiro sums, simplifying proofs of classical results and enabling the discovery of new properties.
Contribution
It introduces a novel approach combining logic and automata theory to study Rudin-Shapiro sums, streamlining proofs and extending existing results.
Findings
Unified framework for Rudin-Shapiro sums
Simplified proofs of classical results
New properties of Rudin-Shapiro sums uncovered
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.
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
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · graph theory and CDMA systems
