Permutation Help: Solve (4 2 1)(5 4 9 10)(2 3 4)(7 1)(3 6)

  • Thread starter Thread starter Seb97
  • Start date Start date
  • Tags Tags
    Permutation
Click For Summary

Homework Help Overview

The discussion revolves around computing a permutation in the symmetric group S10, specifically the product of several cycles: (4 2 1)(5 4 9 10)(2 3 4)(7 1)(3 6). Participants are exploring methods to effectively compute this permutation using two-row notation.

Discussion Character

  • Exploratory, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the practicality of using two-row notation for multiplying permutations and question the best method for handling multiple cycles. Some express uncertainty about the computation process and seek clarification on how to transition from the two-row format to cycle notation.

Discussion Status

There is an ongoing exchange of methods for computing the permutation, with some participants sharing their approaches and others questioning the efficiency of those methods. While one participant reports achieving a correct answer, they acknowledge that their method may not be the most practical.

Contextual Notes

Participants mention the complexity of the problem increases with more cycles, indicating a potential challenge in managing the computations effectively. There is also a reference to a deadline for the homework, adding urgency to the discussion.

Seb97
Messages
15
Reaction score
0

Homework Statement


need to compute this permutation in S10 (4 2 1)(5 4 9 10)(2 3 4)(7 1)(3 6)

Homework Equations


The Attempt at a Solution


I can compute it when i put it into 2 rows eg
1 2 3 4 5 6 7 8 9 10
4 1 3 2 5 6 7 8 9 10 that's equal to ( 4 2 1)
but doing this out with the above permutation isn't pratical. I know you have to start by the right but I not sure what to do with it. Any help would be much appreciated.
 
Physics news on Phys.org
Why isn't it practical? Do the two-row thing for each permutation you have, starting from the right one at the top, and taking the second row of each cycle as the first row of the next cycle; the last row is the second row of the two-row notation for the product. Then compute the cycle decomposition of the result. It's a perfectly sensible way to multiply permutations.
 
Hi thanks for the reply. Ah I am not sure if i compute it the same way as you do.
The way I do it is take the 2 cycles at the end to begin with

1 2 3 4 5 6 7 8 9 10) (1 2 3 4 5 6 7 8 9 10
7 2 3 4 5 6 1 8 9 10) (1 2 6 4 5 3 7 8 9 10
thats what you need to write before you ever need to start computing the first cycle. Well that's what I am used to but its impractical. We have another question where there are more cycles. So I am guessing there is a better method. Is that the way you would do it?
 
No, your computation looks something like this -- for example, let's compute (6 3 5)(5 2 1)(1 3) in [tex]\mathfrak{S}_6[/tex]:

1 2 3 4 5 6
3 2 1 4 5 6 # (1 3)
3 1 5 4 2 6 # (5 2 1)
5 1 6 4 2 3 # (6 3 5)

Apply each cycle in turn, from right to left. The bottom row is your result, so the two-line form of the product (6 3 5)(5 2 1)(1 3) is:

1 2 3 4 5 6
5 1 6 4 2 3

From this we can find the cycle decomposition, (1 5 2)(3 6).
 
It was due for today but I got the right answer the way I did it I checked with a few people and they all have done it your way. Altough my way is correct its a bit impractical.
In the first part you have below. I understand all the stuff you have written the only bit I can't get is how you turned the four rows into the cycle.
1 2 3 4 5 6
5 1 6 4 2 3
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
15
Views
4K
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K