Avoiding Abelian Powers in Partial Words
We study abelian repetitions in partial words, or sequences that may contain some unknown positions or holes. First, we look at the avoidance of abelian pth powers in infinite partial words, where p > 2, extending recent results regarding the case where p = 2. We investigate, for a given p, the smallest alphabet size needed to construct an infinite partial word with finitely or infinitely many holes that avoids abelian pth powers. We construct in particular an infinite binary partial word with infinitely many holes that avoids 6th powers. Then we show, in a number of cases, that the number of abelian p-free partial words of length n with h holes over a given alphabet grows exponentially as n increases. Finally, we prove that we cannot avoid abelian pth powers under arbitrary insertion of holes in an infinite word.
Unable to display preview. Download preview PDF.
- 13.Diekert, V.: Research topics in the theory of free partially commutative monoids. Bulletin of the European Association for Theoretical Computer Science 40, 479–491 (1990)Google Scholar
- 19.Laakso, T.: Musical rendering of an infinite repetition-free string. In: Gefwert, C., Orponen, P., Seppänen, J. (eds.) Logic, Mathematics and the Computer, vol. 14, pp. 292–297. Finnish Artificial Intelligence Society, Symposiosarja, Hakapaino, Helsinki (1996)Google Scholar
- 22.Rivest, R.L.: Abelian square-free dithering for iterated hash functions. MIT, Cambridge (2005), http://people.csail.mit.edu/rivest/publications.html Google Scholar