Article Dans Une Revue International Journal of Foundations of Computer Science Année : 2010

Number of occurrences of powers in strings

Résumé

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.

Domaines

Fichier principal
Vignette du fichier
Number_of_occurrences_of_powers_in_strings.pdf (155.5 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00693448 , version 1 (13-02-2013)

Licence

Identifiants

Citer

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⟩
497 Consultations
789 Téléchargements

Altmetric

Partager

  • More