Paper Info
Title
Avoiding conjugacy classes on the 5-letter alphabet
Abstract
We construct an infinite word w over the 5-letter alphabet such that for every factor f of w of length at least two, there exists a cyclic permutation of f that is not a factor of w. In other words, w does not contain a non-trivial conjugacy class. This proves the conjecture in Gamard et al. [Theoret. Comput. Sci. 726 (2018) 1-4].
Year
DOI
Venue
2018
10.1051/ita/2020003
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS
Keywords
DocType
Volume
Combinatorics on words,conjugacy classes
Journal
54
ISSN
Citations 
PageRank 
0988-3754
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Golnaz Badkobeh19514.12
Pascal Ochem225836.91