请输入您要查询的字词:

 

单词 CentralizerOfAKcycle
释义

centralizer of a k-cycle


Theorem 1.

Let σ be a k-cycle in Sn. Then the centralizerMathworldPlanetmathPlanetmathPlanetmath of σ is

CSn(σ)={σiτ0ik-1,τSn-k}

where Sn-k is the subgroupMathworldPlanetmathPlanetmath of Sn consisting of those permutationsMathworldPlanetmath that fix all elements appearing in σ.

Proof.

This is fundamentally a counting argument. It is clear that σ commutes with each element in the set given, since σ commutes with powers of itself and also commutes with disjoint permutations. The size of the given set is k(n-k)!. However, the number of conjugates of σ is the index of CSn(σ) in Sn by the orbit-stabilizer theorem, so to determine |CSn(σ)| we need only count the number of conjugates of σ, i.e. the number of k-cycles.

In a k-cycle (a1ak), there are n choices for a1, n-1 choices for a2, and so on. So there are n(n-1)(n-k+1) choices for the elements of the cycle. But this counts each cycle k times, depending on which element appears as a1. So the number of k-cycles is

n(n-1)(n-k+1)k

Finally,

n!=|Sn|=n(n-1)(n-k+1)k|CSn(σ)|

so that

|CSn(σ)|=kn!n(n-1)(n-k+1)=k(n-k)!

and we see that the elements in the list above must exhaust CSn(σ).∎

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 1:13:47