| dc.contributor.author | Borchert, Adam | |
| dc.contributor.author | Rampersad, Narad | |
| dc.date.accessioned | 2018-03-15T19:22:11Z | |
| dc.date.available | 2018-03-15T19:22:11Z | |
| dc.date.issued | 2015-10-30 | |
| dc.identifier.citation | Borchert, A., and N. Rampersad, “Words with many palindrome pair factors”, Electronic Journal of Combinatorics 22 (2015): Paper no. P4.23. | en_US |
| dc.identifier.issn | 1077-8926 | |
| dc.identifier.uri | http://hdl.handle.net/10680/1407 | |
| dc.description.abstract | 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 infinite 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. | en_US |
| dc.description.sponsorship | "The first author is supported by an NSERC USRA, the second by an NSERC Discovery Grant." | en_US |
| dc.description.uri | http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p23 | |
| dc.language.iso | en | en_US |
| dc.publisher | The Electronic Journal of Combinatorics | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.title | Words with many palindrome pair factors | en_US |
| dc.type | Article | en_US |
