Efficient computation of class numbers of real abelian number fields

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let {Km} be a parametrized family of real abelian number fields of known regulators, e.g. the simplest cubic fields associated with the Q-irreducible cubic polynomials Pm(x) = x3 − mx2 − (m + 3)x − 1. We develop two methods for computing the class numbers of these Km’s. As a byproduct of our computation, we found 32 cyclotomic fields Q(ζp) of prime conductors p < 1010 for which some prime q ≥ p divides the class numbers h+ p of their maximalrealsubfiel ds Q(ζp)+ (but we did not find any conterexample to Vandiver’s conjecture!).

Cite

CITATION STYLE

APA

Louboutin, S. R. (2002). Efficient computation of class numbers of real abelian number fields. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2369, pp. 134–147). Springer Verlag. https://doi.org/10.1007/3-540-45455-1_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free