The Complexity of Computing all Subfields of an Algebraic Number Field
Symbolic Computation
2017-11-21 v3 Number Theory
Abstract
For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then this leads to faster run times and an improved complexity.
Keywords
Cite
@article{arxiv.1606.01140,
title = {The Complexity of Computing all Subfields of an Algebraic Number Field},
author = {Jonas Szutkoski and Mark van Hoeij},
journal= {arXiv preprint arXiv:1606.01140},
year = {2017}
}
Comments
Slides available at: http://www.math.fsu.edu/~hoeij/2017/Presentation.pdf