Sciweavers

MOC
2002
132views more  MOC 2002»
13 years 10 months ago
Comparison of algorithms to calculate quadratic irregularity of prime numbers
In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k0, using the values of the zeta functi...
Joshua Holden
ANTS
2008
Springer
115views Algorithms» more  ANTS 2008»
14 years 28 days ago
Computing Hilbert Modular Forms over Fields with Nontrivial Class Group
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...
Lassina Dembélé, Steve Donnelly
ANTS
2008
Springer
83views Algorithms» more  ANTS 2008»
14 years 28 days ago
Enumeration of Totally Real Number Fields of Bounded Root Discriminant
We enumerate all totally real number fields F with root discriminant F 14. There are 1229 such fields, each with degree [F : Q] 9. In this article, we consider the following prob...
John Voight