Number of occurrences of powers in strings

Maxime Crochemore (1) , Szilard Zsolt Fazekas (2) , Costas S. Iliopoulos (3) , Inuka Jayasekera (3)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 Research Group on Mathematical Linguistics
3 Informatics

We show a Theta(n log n) bound on the maximal number of occurrences of primitively-rooted k-th powers occurring in a string of length n for any integer k, k >= 2. We also show a Theta(n(2)) bound on the maximal number of primitively-rooted powers with fractional exponent e, 1 < e < 2, occurring in a string of length n. This result holds obviously for their maximal number of occurrences. The first result contrasts with the linear number of occurrences of maximal repetitions of exponent at least 2.

Domains: Automatic Control Engineering

Maxime Crochemore, Szilard Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera. Number of occurrences of powers in strings. International Journal of Foundations of Computer Science, 2010, 21 (4), pp.535--547. ⟨10.1142/S0129054110007416⟩. ⟨hal-00693448⟩