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

In summary: This is the cycle decomposition of the result. The second part is where you say I can compute it when i put it into 2 rows eg 1 2 3 4 5 6 7 8 9 104 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.The problem is that you cannot decompose a permutation into cycles in any simple way. For example, the permutation (5 2 1)(1 3) can be decomposed into the cycles (5
  • #1
Seb97
16
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
  • #2
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.
 
  • #3
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?
 
  • #4
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).
 
  • #5
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
 

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

What is the meaning of "Permutation Help"?

"Permutation Help" refers to a mathematical concept that involves rearranging a set of objects or elements in a specific order. In this case, we are given a sequence of permutations and are asked to solve it.

What does the notation (4 2 1) mean?

The notation (4 2 1) represents a cycle in a permutation, where the element in the first position (4) moves to the second position, the element in the second position (2) moves to the third position, and the element in the third position (1) moves to the first position. This notation is commonly used to represent permutations.

How do I solve the given sequence of permutations?

To solve the given sequence of permutations, we need to perform the given cycles in order from left to right. So, we start by performing the cycle (4 2 1), followed by (5 4 9 10), (2 3 4), (7 1), and (3 6). This will give us the final permutation (5 9 7 3 1 10 2 6 4).

What is the significance of the order of the cycles?

The order of the cycles is important because it determines the order in which the elements are rearranged. If we were to perform the cycles in a different order, we would get a different permutation as the result.

Are there any shortcuts or tricks to solve permutations?

There are certain techniques and algorithms that can help in solving permutations more efficiently, such as using cycle notation, decomposing a permutation into disjoint cycles, and using the concept of inverses. However, it ultimately depends on the specific permutation and there is no one universal shortcut for solving all permutations.

Back
Top