Abelian Repetitions in Partial Words

F. Blanchet-Sadri       Sean Simmons       Dimin Xu

Abstract       Implementation       Paper      

Given an integer p and a partial word w, the application below checks to see if the given partial word contains any abelian pth powers for p>2. If it does contain an abelian pth power, the program then outputs exactly which abelian pth powers it contains. For an applet that can find out whether a given partial word contains an abelian square, visit abelian squares.

 

This page may not function correctly if you do not have the latest Java Runtime Environment and the latest Java Plugin.


Partial Words Logo
Valid XHTML 1.0!
Acknowledgement: This material is based upon work supported by the National Science Foundation under Grant No. DMS-0754154. The Department of Defense is also gratefully acknowledged.
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.
NSF
Valid CSS!