Abstract
An overlap-free (or -free) word over a fixed alphabet is extremal if every word obtained from by inserting a single letter from at any position contains an overlap (or a factor of exponent at least , respectively). We find all lengths which admit an extremal overlap-free binary word. For every extended real number such that , we show that there are arbitrarily long extremal -free binary words.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.