arXiv · 2005.14110
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 (\log n)^2})$ for an explicit constant $c$.
Explore related subjects
Keep this discovery
Robert J. Lemke Oliver, Frank Thorne. 2020-05-28. Upper bounds on number fields of given degree and bounded discriminant. https://arxiv.org/abs/2005.14110
Cite the original work for its findings. Save a collection to share your selection of sources.