Showing math.COShow all
3 papers · 1 filter
math.CO2023
More characterizations of morphic words
Golnaz Badkobeh, Pascal Ochem
An interesting phenomenon in combinatorics on words is when every recurrent word satisfying some avoidance constraints has the same factor set as a morphic word. An early example i…
math.CO2021
Avoiding Square-Free Words on Free Groups
Golnaz Badkobeh, Tero Harju, Pascal Ochem +1
We consider sets of factors that can be avoided in square-free words on two-generator free groups. The elements of the group are presented in terms of 0,1,2,3 such that 0 and 2 (re…
math.CO2018
Avoiding conjugacy classes on the 5-letter alphabet
Golnaz Badkobeh, Pascal Ochem
We construct an infinite word over the -letter alphabet such that for every factor of of length at least two, there exists a cyclic permutation of that is not a…