Abstract
AbstractWe give a heuristic argument supporting conjectures of Bhargava on the asymptotics of the number of ‐number fields having bounded discriminant. We then make our arguments rigorous in the case giving a new elementary proof of the Davenport–Heilbronn theorem. Our basic method is to count elements of small height in ‐fields while carefully keeping track of the index of the monogenic ring that they generate.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
