The Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: Symetric group
Replies: 1   Last Post: Jun 15, 1996 11:06 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Mustapha Benali

Posts: 6
Registered: 12/12/04
Symetric group
Posted: Jun 15, 1996 6:58 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply



Can someone help me to resolve this problem :


Sn = group of all permutations of the set {1,2, ... ,n}

Let H0 and H1 be two permutations in Sn :

/ 1 2 3 4 .... (n-2) (n-1) n H0 =| |
\ 2 3 4 5 .... (n-1) 1 n /


/ 1 2 3 4 .... (n-2) (n-1) n H1 =| |
\ 2 3 4 5 .... (n-1) n 1 /


I know that Sn = < H0, H1 > (H0 and H1 generate Sn)

Let f : Sn -----> Sn be a morphism

The question is :
?
Sn = < f(H0), f(H1)> ===> f is an automorphism


Think you.


B.A.M
___________________________________________________________
Ben Ali Mustapha
Picardie Jules Verne University
France
E-Mail: benali@laria.u-picardie.fr







Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2017. All Rights Reserved.