| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438376 | Theoretical Computer Science | 2007 | 4 Pages |
Abstract
Fraenkel and Simpson [A.S. Fraenkel, J. Simpson, How many squares can a string contain? J. Combin. Theory Ser. A 82 (1998) 112ā120] proved that the number of squares in a word of length n is bounded by 2n. In this note we improve this bound to 2nāĪ(logn). Based on the numerical evidence, the conjectured bound is n.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
