Highly Influenced

# Palindromic Length in Free Monoids and Free Groups

@inproceedings{Saarela2017PalindromicLI, title={Palindromic Length in Free Monoids and Free Groups}, author={Aleksi Saarela}, booktitle={WORDS}, year={2017} }

- Published 2017 in WORDS
DOI:10.1007/978-3-319-66396-8_19

Palindromic length of a word is defined as the smallest number n such that the word can be written as a product of n palindromes. It has been conjectured that every aperiodic infinite word has factors of arbitrarily high palindromic length. A stronger variant of this conjecture claims that every aperiodic infinite word has also prefixes of arbitrarily high palindromic length. We prove that these two conjectures are equivalent. More specifically, we prove that if every prefix of a word is a… CONTINUE READING