HAL: hal-00693448, version 1

DOI: 10.1142/S0129054110007416

Detailed view

Export this paper BibTeX - EndNote - TEI - RefWorks -

International Journal of Foundations of Computer Science 21, 4 (2010) 535--547

Number of occurrences of powers in strings

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

(2010)

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.

1:	Laboratoire d'Informatique Gaspard-Monge (LIGM)
	Université Paris-Est Marne-la-Vallée (UPEMLV) – ESIEE – Ecole des Ponts ParisTech – Fédération de Recherche Bézout – CNRS : UMR8049
2:	Research Group on Mathematical Linguistics
	Rovira i Virgili University
3:	Informatics
	King's College London

Subject

:

Computer Science/Automatic Control Engineering

hal-00693448, version 1

http://hal-upec-upem.archives-ouvertes.fr/hal-00693448

oai:hal-upec-upem.archives-ouvertes.fr:hal-00693448

From: Maxime Crochemore <>

Submitted for: test bibigm <>

Submitted on: Wednesday, 13 February 2013 10:12:40

Updated on: Wednesday, 13 February 2013 14:09:36