In this paper, we investigate the number of letters needed to construct partial words with infinitely many holes that avoid abelian 3rd, 4th, or 5th powers. Recent work showed that this number is five for 2nd abelian powers, while it is two for 6th or greater powers.
Keywords: Combinatorics on Words; Partial Words; Abelian Powers.
This material is based upon work supported by the National Science Foundation under Grant No.
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.