Malle's conjecture for for
From MaRDI portal
Publication:4964759
DOI10.1112/S0010437X20007587zbMath1469.11437arXiv1705.00044WikidataQ123024827 ScholiaQ123024827MaRDI QIDQ4964759
Publication date: 3 March 2021
Published in: Compositio Mathematica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.00044
Related Items (8)
On Malle’s conjecture for nilpotent groups ⋮ Torsors for finite group schemes of bounded height ⋮ Counting problems: class groups, primes, and number fields ⋮ The distribution of \(G\)-Weyl CM fields and the Colmez conjecture ⋮ Heuristics for the asymptotics of the number of Sn$S_n$‐number fields ⋮ Idélic approach in enumerating Heisenberg extensions ⋮ Counting 3-dimensional algebraic tori over \(\mathbb{Q}\) ⋮ Statistics of the first Galois cohomology group: a refinement of Malle's conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Davenport-Heilbronn theorems and second order terms
- Secondary terms in counting functions for cubic fields
- The density of discriminants of quintic rings and fields
- Error estimates for the Davenport-Heilbronn theorems
- Squarefree values of multivariable polynomials
- A counter example to Malle's conjecture on the asymptotics of discriminants
- Connected components of Hurwitz schemes and Malle's conjecture
- Asymptotics for number fields and class groups
- The density of discriminants of quartic rings and fields
- COUNTING -FIELDS WITH A POWER SAVING ERROR TERM
- THE DISTRIBUTION OF NUMBER FIELDS WITH WREATH PRODUCTS AS GALOIS GROUPS
- DISCRIMINANTS CUBIQUES ET PROGRESSIONS ARITHMÉTIQUES
- On the probabilities of local behaviors in abelian field extensions
- Density of discriminants of cubic extensions.
- Counting nilpotent Galois extensions
- The density of discriminants of $S_3$-sextic number fields
- On the density of discriminants of cubic fields. II
- On the distribution of Galois groups
This page was built for publication: Malle's conjecture for for