| Issue |
RAIRO-Theor. Inf. Appl.
Volume 54, 2020
|
|
|---|---|---|
| Article Number | 2 | |
| Number of page(s) | 4 | |
| DOI | https://doi.org/10.1051/ita/2020003 | |
| Published online | 20 March 2020 | |
Avoiding conjugacy classes on the 5-letter alphabet
1
Goldsmiths, University of London.
2
LIRMM, Université de Montpellier, CNRS,
Montpellier, France.
‡ Corresponding author: ochem@lirmm.fr
Received:
14
November
2018
Accepted:
18
February
2020
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].
Mathematics Subject Classification: 68R15
Key words: Combinatorics on words / conjugacy classes
© The authors. Published by EDP Sciences, 2020
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.