A run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v with a period p such that 2p≤|v|. The exponent of a run is defined as |v|/p and is greater than or equal to 2. We show new bounds on the maximal sum of exponents of runs in a string of length n. Our upper bound of 4.1n is better than the best previously known proven bound of 5.6n by Crochemore and Ilie (2008). The lower bound of 2.035n, obtained using a family of binary words, contradicts the conjecture of Kolpakov and Kucherov (1999), that the maximal sum of exponents of runs in a string of length n is smaller than 2n. © 2011 Elsevier B.V.
Crochemore, M., Kubica, M., Radoszewski, J., Rytter, W., & Waleń, T. (2012). On the maximal sum of exponents of runs in a string. In Journal of Discrete Algorithms (Vol. 14, pp. 29–36). https://doi.org/10.1016/j.jda.2011.12.016