There are level ternary circular square-free words of length nn for n≠5,7,9,10,14,17.n\ne 5,7,9,10,14,17.

preprint2020arXivOpen access

Abstract

A word is level if each letter appears in it the same number of times, plus or minus 1. We give a complete characterization of the lengths for which level ternary circular square-free words exist. Key words: combinatorics on words, circular words, necklaces, square-free words, non-repetitive sequences

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.