Norm relations and computational problems in number fields - Inria - Institut national de recherche en sciences et technologies du numérique
Article Dans Une Revue Journal of the London Mathematical Society Année : 2022

Norm relations and computational problems in number fields

Résumé

For a finite group $G$, we introduce a generalization of norm relations in the group algebra $\mathbb{Q}[G]$. We give necessary and sufficient criteria for the existence of such relations and apply them to obtain relations between the arithmetic invariants of the subfields of an algebraic number field with Galois group $G$. On the algorithm side this leads to subfield based algorithms for computing rings of integers, $S$-unit groups and class groups. For the $S$-unit group computation this yields a polynomial-time reduction to the corresponding problem in subfields. We compute class groups of large number fields under GRH, and new unconditional values of class numbers of cyclotomic fields.

Dates et versions

hal-02497890 , version 1 (03-03-2020)

Licence

Identifiants

Citer

Jean‐françois Biasse, Claus Fieker, Tommy Hofmann, Aurel Page. Norm relations and computational problems in number fields. Journal of the London Mathematical Society, 2022, 105 (4), pp.2373-2414. ⟨10.1112/jlms.12563⟩. ⟨hal-02497890⟩
216 Consultations
0 Téléchargements

Altmetric

Partager

More