Presentation of a group to generators in A(S)

TylerH
Messages
729
Reaction score
0
Is there a general algorithm for taking the presentation of a group and get the permutation generators for the subgroup of A(S) to which the group is isomorphic?

For example, given x^5=y^4=e, xy=f(c^2) how do I find (12345) and (1243), the permutations corresponding to x and y? BTW, the example is the Frobenious group of order 20, but I'm asking about a general method.
 
Physics news on Phys.org
I think the usual method is the Todd-Coxeter algorithm. It's covered quite extensively in Artin's Algebra.
 

Similar threads

Replies
13
Views
641
Replies
1
Views
2K
Replies
2
Views
2K
Replies
3
Views
502
Replies
1
Views
2K
Replies
2
Views
6K
Replies
9
Views
2K
Back
Top