Title of article
A simple proof that a word of length n has at most distinct squares
Author/Authors
Ilie، نويسنده , , Lucian، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
2
From page
163
To page
164
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 length n is at most 2 n .
Keywords
squares , Combinatorics on words
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2005
Journal title
Journal of Combinatorial Theory Series A
Record number
1531017
Link To Document