How many double squares can a string contain?
Preprint
Abstract
Counting the types of squares rather than their occurrences, we consider the problem of bounding the number of distinct squares in a string. Fraenkel and Simpson showed in 1998 that a string of length n contains at most 2n distinct squares. Ilie presented in 2007 an asymptotic upper bound of 2n - Theta(log n). We show that a string of length n contains at most 5n/3 distinct squares. This new upper bound is obtained by investigating the combinatorial structure of double squares and showing that a string of length n contains at most 2n/3 double squares. In addition, the established structural properties provide a novel proof of Fraenkel and Simpson's result.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- A-step approach to the maximum number of distinct squares and runs in stringsDiscrete Applied Mathematics, 2014
- On the maximum number of cubic subwords in a wordEuropean Journal of Combinatorics, 2013
- More results on overlapping squaresJournal of Discrete Algorithms, 2012
- The three squares lemma revisitedJournal of Discrete Algorithms, 2011
- A note on the number of squares in a wordTheoretical Computer Science, 2007
- A simple proof that a word of length n has at most 2n distinct squaresJournal of Combinatorial Theory, Series A, 2005
- How Many Squares Can a String Contain?Journal of Combinatorial Theory, Series A, 1998
- Squares, cubes, and time-space efficient string searchingAlgorithmica, 1995