An improvement on Schmidt's bound on the number of number fields of bounded discriminant and small degree
Manjul Bhargava, Arul Shankar, Xiaoheng Wang

TL;DR
This paper improves the upper bound on the number of degree n number fields with bounded discriminant for degrees between 6 and 94, using enhanced bounds on certain monic integer polynomials.
Contribution
It provides a tighter upper bound on the count of number fields with bounded discriminant, extending Schmidt's results through new polynomial bounds.
Findings
Improved upper bounds for number fields with degree 6 to 94.
Enhanced bounds on monic integer polynomials with specific discriminant divisibility.
Application of polynomial bounds to number field counting problem.
Abstract
We prove an improvement on Schmidt's upper bound on the number of number fields of degree and absolute discriminant less than X for . We carry this out by improving and applying a uniform bound on the number of monic integer polynomials, having bounded height and discriminant divisible by a large square, that we proved in a previous work.
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
TopicsCoding theory and cryptography · Analytic Number Theory Research · Limits and Structures in Graph Theory
