- #1
Chen
- 977
- 1
Hi,
Is there a general method, given [tex]\sigma[/tex] and [tex]\rho[/tex] in Sn, for finding a permutation [tex]\tau[/tex] in Sn such that [tex]\rho = \tau ^{-1} \sigma \tau[/tex]? I know how to do it when [tex]\sigma[/tex] and [tex]\rho[/tex] are made of a single k-cycle, but what happens when they are more complex?
For example, for:
[tex]\sigma = (1, 2)(3, 4)[/tex]
[tex]\rho = (5, 6)(1, 3)[/tex]
In S6.
Thanks,
Chen
Is there a general method, given [tex]\sigma[/tex] and [tex]\rho[/tex] in Sn, for finding a permutation [tex]\tau[/tex] in Sn such that [tex]\rho = \tau ^{-1} \sigma \tau[/tex]? I know how to do it when [tex]\sigma[/tex] and [tex]\rho[/tex] are made of a single k-cycle, but what happens when they are more complex?
For example, for:
[tex]\sigma = (1, 2)(3, 4)[/tex]
[tex]\rho = (5, 6)(1, 3)[/tex]
In S6.
Thanks,
Chen
Last edited: