Gapplet
Let G be a permutation group of degree n (that is, a subgroup of
Sn),
generated by elements g1, ..., gt.
For input y 
{1,...,n},
a list is given of element of G, expressed both as words in the generators
gi, and as permutations in Sn.
Input the generators g1, ..., gt
as a sequence of permutations, e.g., (1,2,3,4,5,6),(1,2)(3,4)(5,6),(1,6)(2,5)(3,4) |
|
Input the number you want to be stabilized e.g., 1 |
|
Determine the stabilizer of y in G
| |
A list of permutations generating the stabilizer, given in two ways, first in terms of products of the gi, next in disjoint cycle decompositions. | |