TL;DR
This paper introduces a new concept of special scattered subwords with restricted gap lengths, and computes the scattered subword complexity specifically for rainbow words, advancing understanding of subword structures.
Contribution
It defines special scattered subwords with gap constraints and calculates their complexity for rainbow words, providing new insights into subword combinatorics.
Findings
Computed scattered subword complexity for rainbow words
Defined special scattered subwords with gap length restrictions
Extended understanding of subword complexity in combinatorics
Abstract
Special scattered subwords, in which the gaps are of length from a given set, are defined. The scattered subword complexity, which is the number of such scattered subwords, is computed for rainbow words.
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 · Algorithms and Data Compression · Advanced Combinatorial Mathematics