A One-Sided Zimin Construction

A string is Abelian square-free if it contains no Abelian squares; that is, adjacent substrings which are permutations of each other. An Abelian square-free string is maximal if it cannot be extended to the left or right by concatenating alphabet symbols without introducing an Abelian square. We construct Abelian square-free finite strings which are maximal by modifying a construction of Zimin. The new construction produces maximal strings whose length as a function of alphabet size is much shorter than that in the construction described by Zimin.

[1]  William F. Smyth,et al.  Weak repetitions in strings , 1997 .

[2]  P. Pleasants.  Non-repetitive sequences , 1970, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  P. Erdos.  Some unsolved problems. , 1957 .

[4]  A. B. Cook.  Some unsolved problems. , 1952, Hospital management.

[5]  Arturo Carpi,et al.  On the Number of Abelian Square-free Words on Four Letters , 1998, Discret. Appl. Math..

[6]  F. Michel Dekking,et al.  Strongly Non-Repetitive Sequences and Progression-Free Sets , 1979, J. Comb. Theory, Ser. A.

[7]  Veikko Keränen,et al.  Abelian Squares are Avoidable on 4 Letters , 1992, ICALP.

[8]  L. J. Cummings.  Strongly square-free strings on three letters , 1996, Australas. J Comb..

[9]  A. Zimin.  BLOCKING SETS OF TERMS , 1984 .