Finding 12 Permutations Commuting with Alpha=(1,2,4,5)

  • Thread starter Thread starter SqrachMasda
  • Start date Start date
  • Tags Tags
    Permutations
AI Thread Summary
The discussion revolves around finding 12 permutations in S6 that commute with the permutation alpha=(1,2,4,5). Initial attempts included several permutations that were later identified as duplicates or incorrect, as they did not satisfy the commuting condition. The identity permutation and the permutation (3,6) were confirmed as valid solutions, leading to the realization that only 8 distinct permutations exist that commute with alpha, not 12 as initially thought. The concept of commuting permutations was clarified, emphasizing that two permutations commute if their composition is independent of order. The user expressed confusion about the definitions and sought additional resources for further understanding.
SqrachMasda
Messages
42
Reaction score
0
1) In S6 find 12 permutations that commute with alpha=(1,2,4,5)

i did (5,1,2,4)
(4,5,1,2)
(2,4,5,1)
?i don't know if transposition answers this?
but i also did
(1,5)(1,4)(1,2)
and similar for the ones above

i also used
(1,2,4,5)(2,1)
(1,2,4,5)(4,5)
(1,2,4,5)(2,4)

i'm not sure if these are correct because based on directly above i could get a whole lot more than 12
i'm not sure how to answer this
 
Physics news on Phys.org
Your first 3 permutations are all the same, so they don't count as 3 distinct answers. In fact, they are all equal to alpha (which obviously commutes with itself). Now, the identity permutation is one answer. But (1 5)(1 4)(1 2), which is one of the other solutions you gave, is exactly (1 2 4 5). Now (1 2 4 5)(2 1) = (1 4 5), which does not commute with (1 2 4 5). In fact, the other two answers you gave also don't work, i.e.(1 2 4 5)(4 5) = (1 2 4) and (1 2 4 5)(2 4) = (1 2 5) do not commute with (1 2 4 5).

So, so far, the only correct answer you've given is \alpha, and I've mentioned that you can include e (the identity permuation). There should be some very easy ones you can get, since this is after all S_6. You've got (3 6), and so (1 2 4 5)(3 6) as well. There's 4. See if you can get the other 8. Use the fact that you can compose permuatations with \alpha and (3 6) to get a permutation that commutes with \alpha, but make sure to check that the new composition is not equal to one of the one's you've already listed.
 
i was hinking that they had to be equal, which is why i wrote what i wrote, and i also thought 3 and 6 were fixed, but i guess not. I apparently do no understand what exactly commuting means in this situation. My book mentions nothing except that multiplication of disjoint cycles is commutative. I am more confused and frustrated.
 
as update to the original, it turns out there is only 8 so i don't know how anybody could have figured 12. I'm going to search online for help on this and get back with my answer
 
Simply, two permutations a and b commute iff ab = ba.
 
I multiplied the values first without the error limit. Got 19.38. rounded it off to 2 significant figures since the given data has 2 significant figures. So = 19. For error I used the above formula. It comes out about 1.48. Now my question is. Should I write the answer as 19±1.5 (rounding 1.48 to 2 significant figures) OR should I write it as 19±1. So in short, should the error have same number of significant figures as the mean value or should it have the same number of decimal places as...
Thread 'A cylinder connected to a hanging mass'
Let's declare that for the cylinder, mass = M = 10 kg Radius = R = 4 m For the wall and the floor, Friction coeff = ##\mu## = 0.5 For the hanging mass, mass = m = 11 kg First, we divide the force according to their respective plane (x and y thing, correct me if I'm wrong) and according to which, cylinder or the hanging mass, they're working on. Force on the hanging mass $$mg - T = ma$$ Force(Cylinder) on y $$N_f + f_w - Mg = 0$$ Force(Cylinder) on x $$T + f_f - N_w = Ma$$ There's also...
Back
Top