Avoiding conjugacy classes on the 5-letter alphabet
arXiv:1811.08231
Abstract
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 factor of . In other words, does not contain a non-trivial conjugacy class. This proves the conjecture in Gamard et al. [TCS 2018]