Abelian Patterns in Partial Words

F. Blanchet-Sadri       Ian Coley       Benjamin De Winkle

Abstract
Implementation
Paper

We examine the question of whether it is possible to construct any infinite partial word that avoids abelian pth powers (for some p) using polynomial hole spacing. Additionally, we examine some outstanding questions concerning the avoidability index of known abelian avoidable patterns.

Keywords:      Combinatorics on Words; Partial Words; Abelian Powers; Abelian Patterns.

Learn more about partial words.
We're XHTML 1.0 approved!
Acknowledgement: This material is based upon work supported by the National Science Foundation under Grant No. DMS-1060775.
Disclaimer: 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.
Funded by the NSF.
Our CSS is totally valid!