Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Do we know the structure of the centralizer of any element in $S_n$? Or the centralizer of a permutation which has $q$ disjoint $r$-cycles where $r\leq n$. If we know, can anyone give proof or reference? Thanks.

share|improve this question

1 Answer 1

up vote 2 down vote accepted

Conjugating a cycle by any permutation $\sigma$ yields $$\left(i_1 \ldots i_m\right)^\sigma = \left(\sigma(i_1) \ldots \sigma(i_m)\right).$$ You can prove this without too much trouble, but if you get stuck you can find it in Dummit and Foote. So, the centralizer of any cycle is generated by all $\sigma\in S_n$ which cyclically permute $i_1,\ldots, i_m$.

Now consider the case $\tau = (i_1\ldots i_r)(j_1\ldots j_s)$, where the $i's$ and $j's$ are disjoint. If $r\not= s$ then the centralizer of $\tau$ is simply generated by those permutations which cyclically permute the $i$'s and those which cyclically permute the $j$'s. If $r=s$, however, you must also include the permutation $(i_1j_1)(i_2j_2)\cdots (i_rj_r)$ in the centralizer. Of course, any permutation can be written as a product of disjoint cycles, so you can inductively extend this process to find the centralizer of any element of $S_n$.

share|improve this answer
    
Can you explain "cyclically permute"? Thank you for your response. –  Ergin Suer Dec 26 '12 at 22:09
    
Its action on $i_1 \ldots i_m$ should be cyclic, which just means that $\langle (i_1 \ldots i_m)\rangle$ will be included in the centralizer. So for example if you were finding the centralizer of $(1,3,4)$ in $S_5$, it would be generated by $(1,3,4)$ and $(2,5)$. –  Alexander Gruber Dec 26 '12 at 22:13

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.