The group G is called n-rewritable for n>1, if for each sequence of n
elements x1β,x2β,β¦,xnββG there exists a non-identity permutation
ΟβSnβ such that x1βx2ββ―xnβ=xΟ(1)βxΟ(2)ββ―xΟ(n)β. Using computers, Blyth and Robinson (1990) verified that
the alternating group A5β is 8-rewritable. We report on an independent
verification of this statement using the computational algebra system GAP, and
compare the performance of our sequential and parallel code with the original
one.Comment: 5 page