Loïc Grenié, Giuseppe Molteni
Published 2015-07-02Version 1
In [BDyDF08] Belabas, Diaz y Diaz and Friedman show a way to determine, assuming the Generalized Riemann Hypothesis, a set of prime ideals that generate the class group of a number field. Their method is efficient because it produces a set of ideals that is smaller than earlier proved results. Here we show how to use their main result to algorithmically produce a bound that is lower than the one they prove.
Breaking the 4 barrier for the bound of a generating set of the class group
On the $16$-rank of class groups of $\mathbb{Q}(\sqrt{-3p})$ for primes $p$ congruent to $1$ modulo $4$
Explicit bounds for generators of the class group
![QR code for arXiv:1507.00602 [math.NT]](http://oss.arxitics.com/images/favicon.svg)