Sumsets and fixed points of substitutions
F. Michel Dekking
TL;DR
This paper introduces a new technique to analyze the sumset of indicator functions of zeros in fixed points of substitutions on a binary alphabet, advancing understanding of their additive structure.
Contribution
The paper presents a novel method for determining sumsets in the context of fixed points of substitutions, a previously unexplored area.
Findings
New technique for sumset analysis of substitution fixed points
Application to indicator functions of zeros in fixed points
Enhanced understanding of additive properties in symbolic dynamics
Abstract
In this paper we introduce a technique to determine the sumset , where is the indicator function of the 0's occurring in a fixed point of a substitution on the alphabet .
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 · Computability, Logic, AI Algorithms · Algorithms and Data Compression