Computing class fields via the Artin map

  title={Computing class fields via the Artin map},
  author={Claus Fieker},
  journal={Math. Comput.},
  • C. Fieker
  • Published 2001
  • Computer Science, Mathematics
  • Math. Comput.
Based on an explicit representation of the Artin map for Kummer extensions, we present a method to compute arbitrary class fields. As in the proofs of the existence theorem, the problem is first reduced to the case where the field contains sufficiently many roots of unity. Using Kummer theory and an explicit version of the Artin reciprocity law we show how to compute class fields in this case. We conclude with several examples. 
Constructing class fields over local fields
Let K be a p-adic field. We give an explicit charac- terization of the abelian extensions ofK of degreep by relating the coecients of the generating polynomials of extensions L/K of de- greep to theExpand
Minimizing representations over number fields II: Computations in the Brauer group
Abstract Finding minimal fields of definition for representations of finite groups is one of the most important unsolved problems of computational representation theory. While good methods exist forExpand
Computing the Hilbert class field of real quadratic fields
Using the units appearing in Stark's conjectures on the values of L-functions at s=0, we give a complete algorithm for computing an explicit generator of the Hilbert class field of a real quadraticExpand
Computational Class Field Theory
In Chapter 3 we gave the main theoretical results concerning global class field theory over number fields. We are now going to study this subject from the algorithmic point of view. In the presentExpand
Computing the multiplicative group of residue class rings
Algorithms for the computation of the multiplicative group (0k/m0)* of the residue class ring 0k/ m0 and the discrete logarithm therein based on the explicit representation of the group of principal units are presented. Expand
Computing quadratic subfields of number fields
Given a number field, it is an important question in algorithmic number theory to determine all its subfields. If the search is restricted to abelian subfields, one can try to determine them by usingExpand
Computing the Hilbert Class Fields of Quartic CM Fields Using Complex Multiplication
Let K be a quartic CM field, that is, a totally imaginary quadratic extension of a real quadratic number field. In a 1962 article titled On the classfields obtained by complex multiplication ofExpand
Constructing and tabulating dihedral function fields
We present algorithms for constructing and tabulating degree-‘ dihedral extensions of Fq.x/, where q 1 mod 2‘. We begin with a Kummer-theoretic algorithm for constructing these function fields withExpand
Stark's Conjectures and Hilbert's Twelfth Problem
We give a constructive proof of a theorem of Tate, which states that (under Stark's Conjecture) the field generated over a totally real field K by the Stark units contains the maximal real abelianExpand
Computing equations of curves with many points
We explain how to compute the equations of the abelian coverings of any curve defined over a finite field. Then we describe an algorithm which computes curves with many rational points with respectExpand


On the Computation of Hilbert Class Fields
Let k be an algebraic number eld. We describe a procedure for computing the Hilbert class eld ?(k) of k, i.e. the maximal abelian extension unramiied at all places. In the rst part of the paper weExpand
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (Z K /m) * for an ideal m of a number field K, as well as ray class groups of numberExpand
Computing Stark units for totally real cubic fields
A method for computing provably accurate values of partial zeta functions is used to numerically confirm the rank one abelian Stark Conjecture for some totally real cubic fields of discriminant lessExpand
Algebraic Number Theory
This is a corrected printing of the second edition of Lang's well-known textbook. It covers all of the basic material of classical algebraic number theory, giving the student the background necessaryExpand
Computing automorphisms of abelian number fields
This paper describes a fast probabilistic algorithm for computing the conjugates of α, which is based on p-adic techniques, and computes the Frobenius automorphism of p in time polynomial in the size of p and in thesize of m α (x). Expand
A course in computational algebraic number theory
  • H. Cohen
  • Computer Science, Mathematics
  • Graduate texts in mathematics
  • 1993
The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods. Expand
Explicit bounds for primes in residue classes
It follows from the proof that (1)-(3) also hold for arbitrary Galois extensions, provided the authors replace σ by its conjugacy class. Expand
Advanced topics in computational number theory
The present book addresses a number of specific topics in computational number theory whereby the author is not attempting to be exhaustive in the choice of subjects. The book is organized asExpand
Zur expliziten berechnung von ganzheitsbasen in strahlklassenkörpern über einem imaginär-quadratischen zahlkörper
Abstract Let K be an imaginary quadratic number field, K (1) its Hilbert class field, and K (f) the ray class field modulo f over K , where f is an integral ideal in K . Using suitably normalizedExpand
Kant V4
The software package KANT V4 for computations in algebraic number elds is now available in version 4. In addition a new user interface has been released. We will outline the features of this newExpand