Robert J. Lemke Oliver

Upper bounds on number fields of given degree and bounded discriminant

2022 · Duke Mathematical Journal

Let Nn(X) denote the number of degree n number fields with discriminant bounded by X. In this note, we improve the best-known upper bounds on Nn(X), finding that Nn(X)=O(Xc(logn)2) for an explicit constant c.