The number of extensions of a number field with fixed degree and bounded discriminant
Jordan S. Ellenberg (Princeton), Akshay Venkatesh (MIT)

TL;DR
This paper establishes improved upper bounds on the number of degree-specific extensions of a fixed number field with discriminant below a certain threshold, and also provides related lower bounds and bounds for Galois extensions.
Contribution
It introduces sharper upper bounds on the count of such extensions, advancing previous results by Schmidt, and explores related bounds for Galois extensions.
Findings
Improved upper bounds on the number of extensions with fixed degree and bounded discriminant.
Lower bounds for the number of such extensions.
Upper bounds specifically for Galois extensions.
Abstract
We give an upper bound on the number of extensions of a fixed number field of prescribed degree and discriminant less than X; these bounds improve on work of Schmidt. We also prove various related results, such as lower bounds for the number of extensions and upper bounds for Galois extensions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Meromorphic and Entire Functions
