# Norm relations and computational problems in number fields

5 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : 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.
Document type :
Journal articles
Domain :

https://hal.inria.fr/hal-02497890
Contributor : Aurel Page Connect in order to contact the contributor
Submitted on : Tuesday, March 3, 2020 - 10:39:45 PM
Last modification on : Tuesday, April 26, 2022 - 4:25:57 PM

### Citation

Jean-François Biasse, Claus Fieker, Tommy Hofmann, Aurel Page. Norm relations and computational problems in number fields. Journal of the London Mathematical Society, London Mathematical Society, In press, ⟨10.1112/jlms.12563⟩. ⟨hal-02497890⟩

Record views