Periods in Extensions of Words

Let π(w) denote the minimum period of the word w,let w be a primitive word with period π(w) < |w|, and let z be a prefix of w. It is shown that if π(wz) = π(w), then |z| < π(w) − gcd (|w|, |z|). Detailed improvements of this result are also proven. Finally, we show that each primitive word w has a conjugate w′ = vu, where w = uv, such that π(w′) = |w′| and |u| < π(w). As a corollary we give a short proof of the fact that if u,v,w are words such that u2 is a prefix of v2, and v2 is a prefix of w2, and v is primitive, then |w| > 2|u|.

[1]  M. Lothaire Combinatorics on words: Bibliography , 1997 .

[2]  M. Lothaire Algebraic Combinatorics on Words , 2002 .

[3]  Adriaan J. de Lind van Wijngaarden,et al.  On the construction of maximal prefix-synchronized codes , 1996, IEEE Trans. Inf. Theory.

[4]  Maxime Crochemore,et al.  Two-way string-matching , 1991, JACM.

[5]  J. Karhumäki,et al.  ALGEBRAIC COMBINATORICS ON WORDS (Encyclopedia of Mathematics and its Applications 90) By M. LOTHAIRE: 504 pp., 60.00, ISBN 0 521 81220 8 (Cambridge University Press, 2002) , 2003 .

[6]  M. Lothaire,et al.  Algebraic Combinatorics on Words: Index of Notation , 2002 .

[7]  Jean-Pierre Duval,et al.  Periodes et Repetitions des Mots du Monoide Libre , 1979, Theor. Comput. Sci..

[8]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[9]  M. Lothaire,et al.  Combinatorics on words: Frontmatter , 1997 .

[10]  H. Wilf,et al.  Uniqueness theorems for periodic functions , 1965 .

[11]  Juhani Karhumäki,et al.  Combinatorics on words: a tutorial , 2003, Bull. EATCS.

[12]  Maurice Pouzet,et al.  Une caracterisation des mots periodiques , 1979, Discret. Math..

[13]  M. Lothaire,et al.  Applied Combinatorics on Words , 2005 .

[14]  Tero Harju,et al.  Density of Critical Factorizations , 2002, RAIRO Theor. Informatics Appl..

[15]  M. Lothaire Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) , 2005 .

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