Heuristics for the asymptotics of the number of Sn$S_n$‐number fields

DOI10.1112/JLMS.12720arXiv2006.09620MaRDI QIDQ6176442

Author name not available (Why is that?)

Publication date: 23 August 2023

Published in: (Search for Journal in Brave)

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

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

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: Heuristics for the asymptotics of the number of Sn$S_n$‐number fields

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