activity
20052023
most citedA proof of Dejean's conjecture

9 citations · 47 across the 34 of their papers we have counts for

collaborators
Showing math.COShow all

28 papers · 1 filter

math.CO2023

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…

math.CO2022★ 3 cited

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…

math.CO2022★ 1 cited

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…

math.CO2021

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…

math.CO2020

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…

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…