Comparing the order and the minimal number of generators of a transitive permutation group
classification
🧮 math.GR
keywords
grouppermutationtendstransitivecomparinggeneratorsinftyminimal
read the original abstract
We prove that if $G$ is a transitive permutation group, then $d(G)\log{|G|}/n^{2}$ tends to $0$ as $n$ tends to $\infty$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.