Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 12 Nov 2023 in math.NT and math.GR | (2311.06947v2)

Abstract: A folklore conjecture asserts the existence of a constant $c_n > 0$ such that $#\mathcal{F}_n(X) \sim c_n X$ as $X\to \infty$, where $\mathcal{F}_n(X)$ is the set of degree $n$ extensions $K/\mathbb{Q}$ with discriminant bounded by $X$. This conjecture is known if $n \leq 5$, but even the weaker conjecture that there exists an absolute constant $C\geq 1$ such that $#\mathcal{F}_n(X) \ll_n XC$ 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.

Citations (3)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.