Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 
 

 

Explicit bounds for generators of the class group


Authors: Loïc Grenié and Giuseppe Molteni
Journal: Math. Comp. 87 (2018), 2483-2511
MSC (2010): Primary 11R04; Secondary 11R29
DOI: https://doi.org/10.1090/mcom/3281
Published electronically: November 16, 2017
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Assuming Generalized Riemann's Hypothesis, Bach proved that the class group $ \mathcal C\!\ell _{\mathbf {K}}$ of a number field $ \mathbf {K}$ may be generated using prime ideals whose norm is bounded by $ 12\log ^2\Delta _{\mathbf {K}}$, and by $ (4+o(1))\log ^2\Delta _{\mathbf {K}}$ asymptotically, where $ \Delta _{\mathbf {K}}$ is the absolute value of the discriminant of $ \mathbf {K}$. Under the same assumption, Belabas, Diaz y Diaz and Friedman showed a way to determine a set of prime ideals that generates $ \mathcal C\!\ell _{\mathbf {K}}$ and which performs better than Bach's bound in computations, but which is asymptotically worse. In this paper we show that $ \mathcal C\!\ell _{\mathbf {K}}$ is generated by prime ideals whose norm is bounded by the minimum of $ 4.01\log ^2\Delta _{\mathbf {K}}$, $ 4\big (1+\big (2\pi e^{\gamma })^{-N_{\mathbf {K}}}\big )^2\log ^2\Delta _{\mathbf {K}}$ and $ 4\big (\log \Delta _{\mathbf {K}} +\log \log \Delta _{\mathbf {K}}-(\gamma +\l... ...\frac {\log (7\log \Delta _{\mathbf {K}})} {\log \Delta _{\mathbf {K}}}\big )^2$. Moreover, we prove explicit upper bounds for the size of the set determined by Belabas, Diaz y Diaz and Friedman's algorithms, confirming that it has size $ \asymp (\log \Delta _{\mathbf {K}}\log \log \Delta _{\mathbf {K}})^2$. In addition, we propose a different algorithm which produces a set of generators which satisfies the above mentioned bounds and in explicit computations turns out to be smaller than $ \log ^2\Delta _{\mathbf {K}}$ except for $ 7$ out of the $ 31292$ fields we tested.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2010): 11R04, 11R29

Retrieve articles in all journals with MSC (2010): 11R04, 11R29


Additional Information

Loïc Grenié
Affiliation: Dipartimento di Ingegneria gestionale, dell’informazione e della produzione, Università degli Studi di Bergamo, viale Marconi 5, 24044 Dalmine (BG) Italy
Email: loic.grenie@gmail.com

Giuseppe Molteni
Affiliation: Dipartimento di Matematica, Università di Milano, via Saldini 50, 20133 Milano, Italy
Email: giuseppe.molteni1@unimi.it

DOI: https://doi.org/10.1090/mcom/3281
Received by editor(s): July 8, 2016
Received by editor(s) in revised form: October 14, 2016, January 30, 2017, and March 29, 2017
Published electronically: November 16, 2017
Article copyright: © Copyright 2017 American Mathematical Society

American Mathematical Society