当前位置:
X-MOL 学术
›
Random Struct. Algorithms
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Dixon's asymptotic without the classification of finite simple groups
Random Structures and Algorithms ( IF 1 ) Pub Date : 2023-12-18 , DOI: 10.1002/rsa.21205 Sean Eberhard 1
Random Structures and Algorithms ( IF 1 ) Pub Date : 2023-12-18 , DOI: 10.1002/rsa.21205 Sean Eberhard 1
Affiliation
Without using the classification of finite simple groups (CFSG), we show that the probability that two random elements of generate a primitive group smaller than is at most . As a corollary we get Dixon's asymptotic expansion
中文翻译:
没有有限单群分类的 Dixon 渐近
在不使用有限简单群分类(CFSG)的情况下,我们证明了两个随机元素的概率 生成一个小于的原始群 至多是 。作为推论,我们得到 Dixon 的渐近展开式
更新日期:2023-12-22
中文翻译:
没有有限单群分类的 Dixon 渐近
在不使用有限简单群分类(CFSG)的情况下,我们证明了两个随机元素的概率