Avoiding fractional powers over the natural numbers
Lara Pudwell, Eric Rowland

TL;DR
This paper investigates the structure of the lexicographically least infinite words over non-negative integers that avoid fractional powers, revealing fixed points of morphisms and connections to automatic sequences.
Contribution
It identifies the structure of these words for various rational ratios and develops an automated method to prove power-freeness of morphic words.
Findings
The least $7/4$-power-free word is a fixed point of a 50847-uniform morphism.
The structure of words for three families of rationals is characterized.
The $27/23$-power-free word over a finite alphabet is 353-automatic.
Abstract
We study the lexicographically least infinite -power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closely related to one. For example, the lexicographically least -power-free word is a fixed point of a -uniform morphism. We identify the structure of the lexicographically least -power-free word for three infinite families of rationals as well many "sporadic" rationals that do not seem to belong to general families. To accomplish this, we develop an automated procedure for proving -power-freeness for morphisms of a certain form, both for explicit and symbolic rational numbers . Finally, we establish a connection to words on a finite alphabet. Namely, the lexicographically least -power-free word is in fact a word on the finite alphabet , and its sequence 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.
