New Computations Concerning the Cohen-Lenstra Heuristics
te Riele, Herman ; Williams, Hugh
Experiment. Math., Tome 12 (2003) no. 1, p. 99-113 / Harvested from Project Euclid
Let h(p) denote the class number of the real quadratic field formed by adjoining $\sqp$} where p is a prime, to the rationals. The Cohen-Lenstra heuristics suggest that the probability that $h(p)=k$ (a given odd positive integer) is given by $Cw(k)/k$, where C is an explicit constant and w(k) is an explicit arithmetic function. For example, we expect that about 75.45 % of the values of h(p) are 1, 12.57% are 3, and 3.77% are 5. Furthermore, a conjecture of Hooley states that $H(x):=\sum_{p\le x}h(p)\sim x/8,$ ¶ where the sum is taken over all primes congruent to 1 modulo 4. In this paper, we develop some fast techniques for evaluating h(p) where p is not very large and provide some computational results in support of the Cohen-Lenstra heuristics. We do this by computing h(p) for all p ($\equiv1\bmod{4}$) and $p<2\cdot10^{11}$. We also tabulate H(x) up to $2\cdot10^{11}$.
Publié le : 2003-05-14
Classification:  Distribution of class numbers,  Cohen-Lenstra heuristics,  Hooley's conjecture,  11R29,  11Y40
@article{1064858787,
     author = {te Riele, Herman and Williams, Hugh},
     title = {New Computations Concerning the Cohen-Lenstra Heuristics},
     journal = {Experiment. Math.},
     volume = {12},
     number = {1},
     year = {2003},
     pages = { 99-113},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1064858787}
}
te Riele, Herman; Williams, Hugh. New Computations Concerning the Cohen-Lenstra Heuristics. Experiment. Math., Tome 12 (2003) no. 1, pp.  99-113. http://gdmltest.u-ga.fr/item/1064858787/