Perfectly Clustering Words and Iterated Palindromes over a Ternary Alphabet
Combinatorics
2024-06-25 v1
Abstract
Recently, a new characterization of Lyndon words that are also perfectly clustering was proposed by Lapointe and Reutenauer (2024). A word over a ternary alphabet {a,b,c} is called perfectly clustering Lyndon if and only if it is the product of two palindromes and it can be written as apbqc where p and q are palindromes. We study the properties of palindromes appearing as factors p and q and their links with iterated palindromes over a ternary alphabet.
Cite
@article{arxiv.2406.16410,
title = {Perfectly Clustering Words and Iterated Palindromes over a Ternary Alphabet},
author = {Mélodie Lapointe and Nathan Plourde-Hébert},
journal= {arXiv preprint arXiv:2406.16410},
year = {2024}
}
Comments
In Proceedings GASCom 2024, arXiv:2406.14588