
doi: 10.1002/rsa.21205
AbstractWithout 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 for the probability that two random elements of (or ) generate a subgroup containing .
330, Symmetric groups, permutation groups, primitive group, random generation, Asymptotic enumeration, 620, symmetric group, CFSG, primitive groups, Probabilistic methods in group theory, alternating group
330, Symmetric groups, permutation groups, primitive group, random generation, Asymptotic enumeration, 620, symmetric group, CFSG, primitive groups, Probabilistic methods in group theory, alternating group
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
