Computing Arakelov class groups
From MaRDI portal
Abstract: Shanks's infrastructure algorithm and Buchmann's algorithm for computing class groups and unit groups of rings of integers of algebraic number fields are most naturally viewed as computations inside Arakelov class groups. In this paper we discuss the basic properties of Arakelov class groups and of the set of reduced Arakelov divisors. As an application we describe Buchmann's algorithm in this context.
Recommendations
Cited in
(21)- The size function for quadratic extensions of complex quadratic fields
- Random self-reducibility of ideal-SVP via Arakelov random walks
- Genus theory and \(\varepsilon\)-conjectures on \(p\)-class groups
- Invariant generalized ideal classes -- structure theorems for p-class groups in p-extensions
- Modular lattices over cyclotomic fields
- A Terr algorithm for computations in the infrastructure of real-quadratic number fields
- Computing Igusa class polynomials
- A generalization of reduced Arakelov divisors of a number field
- Computing dimensions of spaces of Arakelov divisors of number fields
- The infrastructure of a global field of arbitrary unit rank
- The size function for cyclic cubic fields
- On reduced Arakelov divisors of real quadratic fields
- Computing class groups of function fields using Stark units
- scientific article; zbMATH DE number 5124678 (Why is no real title available?)
- Heuristics and conjectures in the direction of a \(p\)-adic Brauer-Siegel theorem
- A bound of the number of reduced Arakelov divisors of a number field
- The size function for imaginary cyclic sextic fields
- Reduced ideals from the reduction algorithm
- Well-rounded ideal lattices of cyclic cubic and quartic fields
- Arakelov class groups of random number fields
- Upper bounds for Euclidean minima of algebraic number fields
This page was built for publication: Computing Arakelov class groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3615930)
