Upper bounds on number fields of given degree and bounded discriminant Article Swipe
Related Concepts
Discriminant
Bounded function
Degree (music)
Mathematics
Combinatorics
Constant (computer programming)
Upper and lower bounds
Linear discriminant analysis
Discrete mathematics
Statistics
Mathematical analysis
Physics
Computer science
Artificial intelligence
Programming language
Acoustics
Robert J. Lemke Oliver
,
Frank Thorne
·
YOU?
·
· 2020
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2005.14110
· OA: W4293713395
YOU?
·
· 2020
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2005.14110
· OA: W4293713395
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$.
Related Topics
Finding more related topics…