Upper bounds on number fields of given degree and bounded discriminant

From MaRDI portal

DOI10.1215/00127094-2022-0046zbMATH Open1504.11121arXiv2005.14110OpenAlexW3031380322MaRDI QIDQ2093537

Author name not available (Why is that?)

Publication date: 27 October 2022

Published in: (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/2005.14110



No records found.


No records found.








This page was built for publication: Upper bounds on number fields of given degree and bounded discriminant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093537)