arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1611.02501math.GR
收藏

生成对称群的概率

The Probability of Generating the Symmetric Group

Sean Eberhard, Stefan-Christoph Virchow

AI总结:

该研究针对随机置换生成对称群或交错群的概率猜想,给出了不依赖有限单群分类的初等证明,得到更精细的渐近阶结果,证明基于特征标理论与相关最新估计。

摘要:

我们研究一对随机置换生成交错群$A_n$或对称群$S_n$的概率$p(S_n)$。Dixon(1969)证明了当$n\to\infty$时$p(S_n)$趋近于1,并猜想$p(S_n)=1-1/n+o(1/n)$。该猜想由Babai(1989)利用有限单群分类得到验证。我们给出该结果的一个初等证明,具体证明了$p(S_n)=1-1/n+\mathcal{O}(n^{-2+\varepsilon})$。我们的证明基于特征标理论与特征标估计,其中包含Schlage-Puchta(2012)的最新研究成果。

英文摘要:

We consider the probability $p(S_n)$ that a pair of random permutations generates either the alternating group $A_n$ or the symmetric group $S_n$. Dixon (1969) proved that $p(S_n)$ approaches $1$ as $n\to\infty$ and conjectured that $p(S_n)=1-1/n+o(1/n)$. This conjecture was verified by Babai (1989), using the Classification of Finite Simple Groups. We give an elementary proof of this result; specifically we show that $p(S_n)=1-1/n+\mathcal {O}(n^{-2+ε})$. Our proof is based on character theory and character estimates, including recent work by Schlage-Puchta (2012).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑