Name
Abstract | ||
|---|---|---|
. All our words (strings) are over a fixed alphabet. A square is a subword of the formuu = u2, where u is a nonempty word. Two squares are distinct if they are of different shape,not just translates of each other. A word u is primitive if u cannot be written in the form u = vjfor some j 2. A square u2with u primitive is primitive rooted. Let M (n) denote the maximumnumber of distinct squares, P (n) the number of distinct primitive rooted squares in a word of lengthn. We... |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1006/jcta.1997.2843 | J. Comb. Theory, Ser. A |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Mathematics | Journal | 82 |
Issue | ISSN | Citations |
1 | Journal of Combinatorial Theory, Series A | 54 |
PageRank | References | Authors |
5.64 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aviezri S. Fraenkel | 1 | 559 | 164.51 |
| Jamie Simpson | 2 | 164 | 21.41 |