2015/09/17 by Adam Borchert, Narad Rampersad, Borchert, Adam +1 · 1 citation
Computer Science · Mathematics · #68R15 #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #cs.FL #math.CO #msc:68R15
paper · pdf · doi:10.48550/arxiv.1509.05396
arxiv created 2015/09/17 · arxiv updated 2015/09/18
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the property that for infinitely many n, every length-n factor is a product of two palindromes. We show that every Sturmian word has this property, but this does not characterize the class of Sturmian words. We also show that the Thue-Morse word does not have this property. We investigate finite words with the maximal number of distinct palindrome pair factors and characterize the binary words that are not palindrome pairs but have the property that every proper factor is a palindrome pair.