Computational class field theory
From MaRDI portal
Abstract: Class field theory furnishes an intrinsic description of the abelian extensions of a number field that is in many cases not of an immediate algorithmic nature. We outline the algorithms available for the explicit computation of such extensions.
Recommendations
Cited in
(12)- Natural orders for asymmetric space-time coding: minimizing the discriminant
- A survey of computational class field theory
- Primes of the form x^2 + d y^2 with x 0 N or y 0 N
- On the computation of class polynomials with ``thetanullwerte`` and its applications to the unit group computation
- Hypergeometric functions over finite fields
- scientific article; zbMATH DE number 3356897 (Why is no real title available?)
- SIC-POVMs from Stark units: Prime dimensions n2 + 3
- Explicit computations in Iwasawa theory
- On the construction of class fields
- Visual aspects of Gaussian periods and analogues
- SIC-POVMs from Stark units: dimensions n^2 + 3 = 4p, p prime
- Computing the local group of prime-power classes
This page was built for publication: Computational class field theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3615931)