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.
No takes yet. Share an insight, caveat, or question.
Oliver et al. (2022) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: