arXiv Analytics

Sign in

arXiv:2311.13003 [math.CO]AbstractReferencesReviewsResources

Critical exponent of binary words with few distinct palindromes

L'ubomíra Dvořáková, Pascal Ochem, Daniela Opočenská

Published 2023-11-21Version 1

We study infinite binary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponents. This extends results by Fici and Zamboni [TCS 2013]. Interestingly, the words with 18 and 20 palindromes happen to be morphic images of the fixed point of the morphism $\texttt{0}\mapsto\texttt{01}$, $\texttt{1}\mapsto\texttt{21}$, $\texttt{2}\mapsto\texttt{0}$.

Related articles: Most relevant | Search more
arXiv:1504.04069 [math.CO] (Published 2015-04-15)
Critical exponents of graphs
arXiv:2209.09598 [math.CO] (Published 2022-09-20)
Complement Avoidance in Binary Words
arXiv:0710.4031 [math.CO] (Published 2007-10-22)
On the critical exponent of generalized Thue-Morse words