Uniform exponent bounds on the number of primitive extensions of number fields

A folklore conjecture asserts the existence of a constant $c_n>0$ such that $\mathrm{\#}{\mathcal{F}}_n(X)\sim c_{n}X$ as $X\to \mathrm{\infty }$, where ${\mathcal{F}}_n(X)$ is the set of degree $n$ extensions $K\mathrm{/}\mathbb{Q}$ with discriminant bounded by $X$. This conjecture is known if $n\le 5$, but even the weaker conjecture that there exists an absolute constant $C\ge 1$ such that $\mathrm{\#}{\mathcal{F}}_n(X){\ll }_n{X}^C$ remains unknown and apparently out of reach. Here, we make progress on this weaker conjecture (which we term the “uniform exponent conjecture”) in two ways. First, we reduce the general problem to that of studying relative extensions of number fields whose Galois group is an almost simple group in a natural primitive permutation representation. Second, for almost all such groups, we prove the strongest known upper bound on the number of such extensions. These bounds have the effect of resolving the uniform exponent conjecture for solvable groups, sporadic groups, exceptional groups, and classical groups of bounded rank.