Abstract
We propose a stronger conjecture regarding the number of distinct squares in a binary word. Fraenkel and Simpson conjectured in 1998 that the number of distinct squares in a word is upper bounded by the length of the word. Here, we conjecture that in the case of a word of length n over the alphabet {a,b}, the number of distinct squares is upper bounded by, where k is the least of the number of a's and the number of b's. We support the conjecture by showing its validity for several classes of binary words. We also prove that the bound is tight. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Jonoska, N., Manea, F., & Seki, S. (2014). A stronger square conjecture on binary words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8327 LNCS, pp. 339–350). Springer Verlag. https://doi.org/10.1007/978-3-319-04298-5_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
