2022/04/04 by Manjul Bhargava, Arul Shankar, Bhargava, Manjul +3 · 2 citations
Computer Science · Mathematics · #Analytic Number Theory Research #Coding theory and cryptography #FOS: Mathematics #Limits and Structures in Graph Theory #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2204.01331
openalex publication_date 2022/04/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We prove an improvement on Schmidt's upper bound on the number of number fields of degree n and absolute discriminant less than X for 6 ≤ n ≤ 94. 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.