Jesse T. Johnson

most citedThere are level ternary circular square-free words of length

n

for

n \neq = 5, 7, 9, 10, 14, 17.

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2020

Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101

James D. Currie, Jesse T. Johnson

We characterize exactly the lengths of binary circular words containing no squares other than 00, 11, and 0101. Key words: combinatorics on words, circular words, necklaces, square…

math.CO2020★ 1 cited

There are level ternary circular square-free words of length $n$ for $n \neq = 5, 7, 9, 10, 14, 17.$

James D. Currie, Jesse T. Johnson

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-f…

Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101

There are level ternary circular square-free words of length n for n=5,7,9,10,14,17.

There are level ternary circular square-free words of length $n$ for $n \neq = 5, 7, 9, 10, 14, 17.$