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 \(\frac{2k-1}{2k+2}n\), 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Fraenkel, A.S., Simpson, J.: How many squares can a string contain? Journal of Combinatorial Theory, Series A 82, 112–120 (1998)
Deza, A., Franek, F., Jiang, M.: A d-step approach for distinct squares in strings. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 77–89. Springer, Heidelberg (2011)
Ilie, L.: A note on the number of squares in a word. Theoretical Computer Science 380, 373–376 (2007)
Fan, K., Puglisi, S.J., Smyth, W.F., Turpin, A.: A new periodicity lemma. SIAM Journal of Discrete Mathematics 20(3), 656–668 (2005)
Ilie, L.: A simple proof that a word of length n has at most 2n distinct squares. Journal of Combinatorial Theory, Series A 112(1), 163–164 (2005)
Kopylova, E., Smyth, W.F.: The three squares lemma revisited. Journal of Discrete Algorithms 11, 3–14 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Jonoska, N., Manea, F., Seki, S. (2014). A Stronger Square Conjecture on Binary Words. In: Geffert, V., Preneel, B., Rovan, B., Štuller, J., Tjoa, A.M. (eds) SOFSEM 2014: Theory and Practice of Computer Science. SOFSEM 2014. Lecture Notes in Computer Science, vol 8327. Springer, Cham. https://doi.org/10.1007/978-3-319-04298-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-04298-5_30
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04297-8
Online ISBN: 978-3-319-04298-5
eBook Packages: Computer ScienceComputer Science (R0)