首页   按字顺浏览 期刊浏览 卷期浏览 On the length of subgroup chains in the symmetric group
On the length of subgroup chains in the symmetric group

 

作者: László Babai,  

 

期刊: Communications in Algebra  （Taylor Available online 1986）
卷期: Volume 14, issue 9  

页码: 1729-1736

 

ISSN:0092-7872

 

年代: 1986

 

DOI:10.1080/00927878608823393

 

出版商: Gordon and Breach Science Publishers Ltd.

 

数据来源: Taylor

 

摘要:

We prove that for n≥2, the length of every subgroup chain inSnis at most 2n-3. The proof rests on an upper bound for the order of primitive permutation groups, due to Praeger and Saxl. The result has applications to worst case complexity estimates for permutation group algorithms.

 

点击下载:  PDF (194KB)



返 回