Skip to Main content Skip to Navigation
Journal articles

The maximal number of cubic runs in a word

Abstract : A run is an inclusion maximal occurrence in a word (as a subinterval) of a factor in which the period repeats at least twice. The maximal number of runs in a word of length n has been thoroughly studied, and is known to be between 0.944n and 1.029n. The proofs are very technical. In this paper we investigate cubic runs, in which the period repeats at least three times. We show the upper bound on their maximal number, cubic-runs(n), in a word of length n: cubic-runs(n) < 0.5n. The proof of linearity of cubic-runs(n) utilizes only simple properties of Lyndon words and is considerably simpler than the corresponding proof for general runs. For binary words, we provide a better upper bound cubic-runs2(n) < 0.48n which requires computer-assisted verification of a large number of cases. We also construct an infinite sequence of words over a binary alphabet for which the lower bound is 0.41n.
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Thursday, April 19, 2018 - 5:06:00 PM
Last modification on : Saturday, January 15, 2022 - 3:57:56 AM
Long-term archiving on: : Tuesday, September 18, 2018 - 4:11:31 PM


Files produced by the author(s)



Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, et al.. The maximal number of cubic runs in a word. Journal of Computer and System Sciences, Elsevier, 2012, 78 (6), pp.1828-1836. ⟨10.1016/j.jcss.2011.12.005⟩. ⟨hal-00836960⟩



Record views


Files downloads