2015/07/02 by Loïc Grenié, Grenié, Loïc, Giuseppe Molteni +1
Engineering · #11R04 (Primary) #11R29 (Secondary) #FOS: Mathematics #Number Theory (math.NT) #Scheduling and Optimization Algorithms
paper · pdf · doi:10.48550/arxiv.1507.00602
openalex publication_date 2015/07/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.