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. 


