A simple proof that a word of length n has at most...

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

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 2n.

Authors

Ilie L

Journal

Journal of Combinatorial Theory Series A, Vol. 112, No. 1, pp. 163–164

Publisher

Elsevier

Publication Date

October 1, 2005

DOI

10.1016/j.jcta.2005.01.006

ISSN

0097-3165

Associated Experts

Lucian Ilie

Adjunct Professor, Faculty of Engineering

Visit profile

Labels

Fields of Research (FoR)

4901 Applied mathematics 4904 Pure mathematics 49 Mathematical Sciences

View published work (Non-McMaster Users)

View published work (McMaster Users)

Contact the Experts team

Get technical help

Provide website feedback