Heuristics for the asymptotics of the number of SnS_n-number fields

preprint2020arXivOpen access

Abstract

We give a heuristic argument supporting conjectures of Bhargava on the asymptotics of the number of SnS_n-number fields having bounded discriminant. We then make our arguments rigorous in the case n=3n=3 giving a new elementary proof of the Davenport-Heilbronn theorem. Our basic method is to count elements of small height in SnS_n-fields while carefully keeping track of the index of the monogenic ring that they generate.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.