论文标题
给定程度和有界判别的数字字段的上限
Upper bounds on number fields of given degree and bounded discriminant
论文作者
论文摘要
令$ n_n（x）$表示$ n $数字字段的数量，其判别为$ x $。在本说明中，我们在$ n_n（x）$上改善了最著名的上限，发现$ n_n（x）= o（x^{c（\ log n）^2}）$用于显式常数$ c $。
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$.
