A [formula omitted]-step approach to the maximum number of distinct squares and runs in strings

Abstract

Fraenkel and Simpson conjectured in 1998 that the number of distinct squares in a string is at most its length. Kolpakov and Kucherov conjectured in 1999 that the number of runs in a string is also at most its length. Since then, both conjectures attracted the attention of many researchers and many results have been presented, including asymptotic lower bounds for both, asymptotic upper bounds for runs, and universal upper bounds for distinct squares in terms of the length. In this survey we point to the combined role played by the length and the number of distinct symbols of the string in both problems. Let us denote σd(n), respectively ρd(n), the maximum number of distinct primitively rooted squares, respectively runs, over all strings of length n containing exactly d distinct symbols. We study both functions σd(n) and ρd(n) and revisit earlier results and conjectures with the (d,n)-parameterized approach. The parameterized approach reveals regularities for both σd(n) and ρd(n) which have been computationally verified for all known values. In addition, the approach provides a computationally efficient framework. We were able to determine all previously known ρ2(n) values for n≤60 in a matter of hours, confirming the results reported by Kolpakov and Kucherov, and were able to extend the computations up to n=74. Similarly, we were able to extend the computations up to n=70 for σ2(n). We point out that σ2(33)<σ3(33); that is, among all strings of length 33, no binary string achieves the maximum number of distinct primitively rooted squares, and that σ2(n)≤2n−85 for n≥70. The computations also reveal the existence of unexpected binary run-maximal string of length 66 containing a quadruple of identical symbols aaaa.