Presentation of a group to generators in A(S)

  • Thread starter TylerH
  • Start date
  • #1
724
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.
 

Answers and Replies

  • #2
360
0
I think the usual method is the Todd-Coxeter algorithm. It's covered quite extensively in Artin's Algebra.
 

Related Threads on Presentation of a group to generators in A(S)

Replies
1
Views
759
Replies
1
Views
2K
Replies
9
Views
931
Replies
2
Views
2K
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
7
Views
3K
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
1
Views
3K
Top