论文信息 - A simple proof that a word of length n has at most 2n distinct squares

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

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.

Lucian Ilie | Lucian Ilie

[1] Tero Harju,et al. Combinatorics on Words , 2004 .

[2] Wojciech Rytter,et al. Squares, cubes, and time-space efficient string searching , 1995, Algorithmica.

[3] J. Allouche. Algebraic Combinatorics on Words , 2005 .

[4] Aviezri S. Fraenkel,et al. How Many Squares Can a String Contain? , 1998, J. Comb. Theory, Ser. A.