12 citations · 46 across the 32 of their papers we have counts for
19 papers · 1 filter
Words avoiding the morphic images of most of their factors
Pascal Ochem, Matthieu Rosenfeld
We say that a finite factor of a word is \emph{imaged} if there exists a non-erasing morphism , distinct from the identity, such that contains . We show that e…
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…
Pseudoperiodic Words and a Question of Shevelev
Joseph Meleshko, Pascal Ochem, Jeffrey Shallit +1
We generalize the familiar notion of periodicity in sequences to a new kind of pseudoperiodicity, and we prove some basic results about it. We revisit the results of a 2012 paper o…
Avoiding large squares in trees and planar graphs
Daniel Gonçalves, Pascal Ochem, Matthieu Rosenfeld
The Thue number of a graph is the minimum number of colors needed to color without creating a square on a path of . For a graph class , is the supremum…
Doubled patterns with reversal and square-free doubled patterns
Antoine Domenech, Pascal Ochem
In combinatorics on words, a word over an alphabet is said to avoid a pattern over an alphabet if there is no factor of such that where $h:Δ^*\toΣ^…