A simple proof that a word of length n has at most 2n distinct squares

Authors:
Lucian Ilie
Affiliations:
Department of Computer Science, University of Western Ontorio, London, Ont., Canada
Venue:
Journal of Combinatorial Theory Series A
Year:
2005

Citing 1
Cited 15

How many squares can a string contain?

Journal of Combinatorial Theory Series A

A note on the number of squares in a word

Theoretical Computer Science
Maximal repetitions in strings

Journal of Computer and System Sciences
Repetitions in strings: Algorithms and combinatorics

Theoretical Computer Science
Counting distinct squares in partial words

Acta Cybernetica
Distinct squares in run-length encoded strings

Theoretical Computer Science
Extracting powers and periods in a string from its runs structure

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
A d-step approach for distinct squares in strings

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Hunting redundancies in strings

DLT'11 Proceedings of the 15th international conference on Developments in language theory
The three-squares lemma for partial words with one hole

Theoretical Computer Science
Squares in binary partial words

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
The maximum number of squares in a tree

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
On the maximum number of cubic subwords in a word

European Journal of Combinatorics
Analysis of maximal repetitions in strings

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
A d-step approach to the maximum number of distinct squares and runs in strings

Discrete Applied Mathematics
Extracting powers and periods in a word from its runs structure

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We give a very short proof of a result by Fraenkel and Simpson (J. combin. Theory. Ser. A 82 (1998) 112) which states that the number of distinct squares in a word of lengh n is at most 2n.