Average number of occurrences of repetitions in a necklace

Authors:
Kazuhiko Kusano;Ayumi Shinohara
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 7
Cited 0

Concrete mathematics: a foundation for computer science

Concrete mathematics: a foundation for computer science
Finding Maximal Repetitions in a Word in Linear Time

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Towards a Solution to the "Runs" Conjecture

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
A Series of Run-Rich Strings

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Repetitions in strings: Algorithms and combinatorics

Theoretical Computer Science
On the maximal sum of exponents of runs in a string

Journal of Discrete Algorithms
Analysis of maximal repetitions in strings

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper, we consider the average number of occurrences of primitively rooted repetitions in a necklace. First, we define circular repetitions for a string and show the average number of them. Using these results, we can obtain the average number of squares, cubes, runs and cubic runs and the average sum of exponents of runs and cubic runs in a necklace, exactly.