TL;DR
This paper demonstrates that paper folding words, a specific type of sequence, contain arbitrarily large abelian powers, revealing complex repetitive structures within these sequences.
Contribution
The paper proves that paper folding words inherently contain arbitrarily large abelian powers, a novel insight into their combinatorial structure.
Findings
Presence of arbitrarily large abelian powers in paper folding words
Establishment of structural complexity in paper folding sequences
Advancement in understanding combinatorial properties of paper folding words
Abstract
We show that paper folding words contain arbitrarily large abelian powers.
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.