First-hit analysis of algorithms for computing quadratic irregularity

DOI10.1090/S0025-5718-03-01593-XMaRDI QIDQ4452171zbMATH OpenOpenAlexFDO

Publication date 12 February 2004

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0011054

Class numbers, class groups, discriminants (11R29) Zeta functions and (L)-functions of number fields (11R42) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Cryptography (94A60)

Abstract: The author has previously extended the theory of regular and irregular primes to the setting of arbitrary totally real number fields. It has been conjectured that the Bernoulli numbers, or alternatively the values of the Riemann zeta function at odd negative integers, are evenly distributed modulo p for every p. This is the basis of a well-known heuristic given by Siegel for estimating the frequency of irregular primes. So far, analyses have shown that if Q(sqrt{D}) is a real quadratic field, then the values of the zeta function zeta_{D}(1-2m)=zeta_{Q(sqrt{D})}(1-2m) at negative odd integers are also distributed as expected modulo p for any p. We use this heuristic to predict the computational time required to find quadratic analogues of irregular primes with a given order of magnitude. We also discuss alternative ways of collecting large amounts of data to test the heuristic.

Recommendations

Cites work

Cited in

(4)

Describes a project that uses

Uses Software

PARI/GP

This page was built for publication: First-hit analysis of algorithms for computing quadratic irregularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452171)