Gap Sequence of Cutting Sequence with Slope $\theta=[0;\dot{d}]$
Yuke Huang, Hanxiong Zhang

TL;DR
This paper analyzes the gap sequence of a specific cutting sequence with slope [0;dot{d}], revealing it has exactly two distinct gaps, and explores related combinatorial properties and palindrome structures.
Contribution
It introduces the kernel and envelope word framework to completely characterize the gap sequence and its properties for the sequence with slope [0;dot{d}].
Findings
The gap sequence has exactly two distinct elements for each factor.
The gap sequence can be explicitly expressed using a substitution based on kernel types.
Identifies all palindromes within the sequence.
Abstract
In this paper, we consider the factor properties and gap sequence of a special type of cutting sequence with slope , denoted by . Let be a factor of , then it occurs in the sequence infinitely many times. Let be the -th occurrence of and be the gap between and . We define the types of kernel words and envelope words, give two versions of "uniqueness of kernel decomposition property". Using them, we prove the gap sequence has exactly two distinct elements for each , and determine the expressions of gaps completely. Furthermore, we prove that the gap sequence is , where is a substitution depending only on the type of , i.e. the kernel word of . We also determine the position of…
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
TopicsCellular Automata and Applications
