9 citations · 47 across the 34 of their papers we have counts for
28 papers · 1 filter
The analogue of overlap-freeness for the period-doubling sequence
James D. Currie
Good words are binary words avoiding factors 11 and 1001, and patterns 0000 and 00010100. We show that good words bear the same relationship to the period-doubling sequence that ov…
Complement Avoidance in Binary Words
James Currie, L'ubomíra Dvořaková, Pascal Ochem +3
The complement of a binary word is obtained by changing each in to and vice versa. We study infinite binary words that avoid sufficiently lar…
Antisquares and Critical Exponents
Aseem Baranwal, James Currie, Lucas Mol +3
The (bitwise) complement of a binary word is obtained by changing each in to and vice versa. An is a nonempty word of the form…
Extending Dekking's construction of an infinite binary word avoiding abelian -powers
James Currie, Lucas Mol, Narad Rampersad +1
We construct an infinite binary word with critical exponent 3 that avoids abelian 4-powers. Our method gives an algorithm to determine if certain types of morphic sequences avoid a…
The undirected repetition threshold and undirected pattern avoidance
James D. Currie, Lucas Mol
For a rational number such that , an undirected -power is a word of the form , where the word is nonempty, the word is in , and we have…
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…