The maximal number of cubic runs in a string

Maxime Crochemore (1, 2) , Costas S. Iliopoulos (1) , Marcin Kubica (3) , Jakub Radoszewski (3) , Wojciech Rytter (3) , Tomasz Walen (3)

1 Informatics
2 LIGM - Laboratoire d'Informatique Gaspard-Monge
3 Institute of Informatics [Warsaw]

A run is an inclusion maximal occurrence in a string (as a subinterval) of a factor in which the period repeats at least twice. The maximal number of runs in a string 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 string 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 strings, we provide a better upper bound cubic-runs_2(n)<0.48n which requires computer-assisted verification of a large number of cases. We also construct an infinite sequence of words over binary alphabet for which the lower bound is 0.41n.

Domaines: Algorithme et structure de données [cs.DS]

Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, et al.. The maximal number of cubic runs in a string. LATA, 2010, Trier, Germany. pp.227-238. ⟨hal-00742037⟩