Borders, palindrome prefixes, and square prefixes

From MaRDI portal
Publication:2224845

DOI10.1016/J.IPL.2020.106027zbMATH Open1506.68087arXiv1906.03689OpenAlexW3087550749MaRDI QIDQ2224845FDOQ2224845


Authors: Daniel Gabric, Jeffrey Shallit Edit this on Wikidata


Publication date: 4 February 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Abstract: We show that the number of length-n words over a k-letter alphabet having no even palindromic prefix is the same as the number of length-n unbordered words, by constructing an explicit bijection between the two sets. A slightly different but analogous result holds for those words having no odd palindromic prefix. Using known results on borders, we get an asymptotic enumeration for the number of words having no even (resp., odd) palindromic prefix . We obtain an analogous result for words having no nontrivial palindromic prefix. Finally, we obtain similar results for words having no square prefix, thus proving a 2013 conjecture of Chaffin, Linderman, Sloane, and Wilks.


Full work available at URL: https://arxiv.org/abs/1906.03689




Recommendations




Cites Work


Cited In (1)

Uses Software





This page was built for publication: Borders, palindrome prefixes, and square prefixes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224845)