Algorithmic Number Theory

DOI10.1007/11792086zbMath1143.11352OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899240

Jürgen Klüners, Étienne Fouvry

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11792086

Mathematics Subject Classification ID

Quadratic extensions (11R11) Class numbers, class groups, discriminants (11R29) Density theorems (11R45)

Related Items (15)

On the distribution of \(\mathrm{Cl}(K)[l^\infty\) for degree \(l\) cyclic fields] ⋮ On Malle’s conjecture for nilpotent groups ⋮ The distribution of sandpile groups of random graphs ⋮ The 8-rank of the narrow class group and the negative Pell equation ⋮ On the 4-rank of class groups of quadratic number fields ⋮ The free group on \(n\) generators modulo \(n + u\) random relations as \(n\) goes to infinity ⋮ Probability theory for random groups arising in number theory ⋮ On Dirichlet biquadratic fields ⋮ \(p^\ell\)-torsion points in finite abelian groups and combinatorial identities ⋮ On the negative Pell equation ⋮ Nonabelian Cohen-Lenstra moments ⋮ Random partitions and Cohen-Lenstra heuristics ⋮ Modeling λ‐invariants by p‐adic random matrices ⋮ On the quotients of the maximal unramified 2-extension of a number field ⋮ Moments and interpretations of the Cohen-Lenstra-Martinet heuristics

This page was built for publication: Algorithmic Number Theory