Avoiding abelian squares in partial words

Erdos raised the question whether there exist infinite abelian square-free words over a given alphabet, that is, words in which no two adjacent subwords are permutations of each other. It can easily be checked that no such word exists over a three-letter alphabet. However, infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investigate the problem of avoiding abelian squares in partial words, or sequences that may contain some holes. In particular, we give lower and upper bounds for the number of letters needed to construct infinite abelian square-free partial words with finitely or infinitely many holes. Several of our constructions are based on iterating morphisms. In the case of one hole, we prove that the minimal alphabet size is four, while in the case of more than one hole, we prove that it is five. We also investigate the number of partial words of length n with a fixed number of holes over a five-letter alphabet that avoid abelian squares and show that this number grows exponentially with n.

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

[2]  Tero Harju,et al.  Overlap-freeness in infinite partial words , 2009, Theor. Comput. Sci..

[3]  S. Mirkin.  Expandable DNA repeats and human disease , 2007, Nature.

[4]  Jean Berstel,et al.  Axel Thue's work on repetitions in words , 1992 .

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

[6]  G. A. Hedlund,et al.  Unending chess, symbolic dynamics and a problem in semigroups , 1944 .

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

[8]  Robert Cori,et al.  On the Number of Partially Abelian Square-Free Words on a Three-Letter Alphabet , 1991, Theor. Comput. Sci..

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

[10]  Veikko Keränen,et al.  New Abelian Square-Free DT0L-Languages over 4 Letters , 2003 .

[11]  Veikko Keränen,et al.  A powerful abelian square-free substitution over 4 letters , 2009, Theor. Comput. Sci..

[12]  Francine Blanchet-Sadri.  Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications) , 2007 .

[13]  John Kelsey,et al.  Second Preimage Attacks on Dithered Hash Functions , 2008, EUROCRYPT.

[14]  Francine Blanchet-Sadri,et al.  An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms , 2009, LATA.

[15]  Florin Manea,et al.  Freeness of partial words , 2007, Theor. Comput. Sci..

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

[17]  Tero Harju,et al.  Square-free partial words , 2008, Inf. Process. Lett..

[18]  Francine Blanchet-Sadri.  Algorithmic Combinatorics on Partial Words , 2012, Int. J. Found. Comput. Sci..

[19]  Francine Blanchet-Sadri,et al.  A generalization of Thue freeness for partial words , 2009, Theor. Comput. Sci..

[20]  J Justin.  Characterization of the repetitive commutative semigroups , 1972 .

[21]  G. A. Hedlund,et al.  Symbolic Dynamics II. Sturmian Trajectories , 1940 .

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

[23]  Jean Berstel,et al.  Partial Words and a Theorem of Fine and Wilf , 1999, Theor. Comput. Sci..

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

[25]  Robert Cori,et al.  Partially Abelian squarefree words , 1990, RAIRO Theor. Informatics Appl..

[26]  Ronald L. Rivest,et al.  Abelian square-free dithering for iterated hash functions , 2005 .

[27]  Francine Blanchet-Sadri,et al.  Abelian Square-Free Partial Words , 2010, LATA.

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

[29]  L. J. Cummings,et al.  A One-Sided Zimin Construction , 2001, Electron. J. Comb..

[30]  Michael Korn.  Maximal abelian square-free words of short length , 2003, J. Comb. Theory, Ser. A.