UPPER BOUNDS ON NUMBER FIELDS OF GIVEN DEGREE AND BOUNDED DISCRIMINANT

摘要

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.