Upper bounds on number fields of given degree and bounded discriminant

Abstract

Let $N_n(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 $N_n(X)$, finding that $N_n(X)=O(X^{c{(logn)}^2})$ for an explicit constant c.