Papers
Topics
Authors
Recent
Search
2000 character limit reached

Norm relations and computational problems in number fields

Published 27 Feb 2020 in math.NT | (2002.12332v4)

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 a normal extension of algebraic number fields with Galois group $G$. On the algorithmic 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.