34 search results - page 1 / 7 » Algorithms for ray class groups and Hilbert class fields |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degr...
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
We show that the locally free class group of an order in a semisimple algebra over a number field is isomorphic to a certain ray class group. This description is then used to prese...
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
MOC
2011
12 years 11 months ago
2011
Let K be an imaginary quadratic field with class number one and let p ⊂ OK be a degree one prime ideal of norm p not dividing 6dK . In this paper we generalize an algorithm of S...