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$.
Sharp upper bounds on the minimal number of elements required to generate a transitive permutation group
On the minimal number of generators of endomorphism monoids of full shifts
A note on $d$-maximal $p$-groups I
![QR code for arXiv:1601.02561 [math.GR]](http://oss.arxitics.com/images/favicon.svg)