2018/12/03 by Petr Ambrož, Ondřej Kadlec, Ambrož, Petr +5
Computer Science · Mathematics · #68R15 #Algorithms and Data Compression #Combinatorics (math.CO) #FOS: Mathematics #Geometric and Algebraic Topology #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1812.00711
openalex publication_date 2018/12/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the palindromic length of factors of infinite words fixed by morphisms of the so-called class P introduced by Hof, Knill and Simon. We show that it grows at most logarithmically with the length of the factor. For the Fibonacci word and the Thue-Morse word we provide estimates on the constants of the growth. We also construct an infinite word rich in palindromes for which the palindromic length grows as √(n).