Avoiding 3/2-powers over the natural numbers
Eric Rowland, Jeffrey Shallit
TL;DR
This paper determines the lexicographically smallest sequence over natural numbers that avoids 3/2-powers, addressing a specific pattern avoidance problem in combinatorics on words.
Contribution
It identifies the minimal sequence over natural numbers that avoids 3/2-powers, providing a new example in the study of pattern avoidance.
Findings
The sequence is explicitly constructed and proven to be minimal.
It extends understanding of pattern avoidance in infinite sequences.
The result has implications for combinatorics and theoretical computer science.
Abstract
In this paper we answer the following question: what is the lexicographically least sequence over the natural numbers that avoids 3/2-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.