AI Chat AI Image Generator AI Video Text to Speech

The Complexity of Computing all Subfields of an Algebraic Number Field

06/03/2016

∙

by Jonas Szutkoski, et al.

∙

∙

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.

Jonas Szutkoski
2 publications
Mark van Hoeij
8 publications

page 1

page 2

page 3

page 4

research

∙ 05/25/2021

On the extension complexity of polytopes separating subsets of the Boolean cube

We show that 1. for every A⊆{0, 1}^n, there exists a polytope P⊆ℝ^n wi...

0 Pavel Hrubes, et al. ∙

research

∙ 12/20/2021

The complexity of solving Weil restriction systems

The solving degree of a system of multivariate polynomial equations prov...

0 Alessio Caminata, et al. ∙

research

∙ 01/12/2017

Functional Decomposition using Principal Subfields

Let f∈ K(t) be a univariate rational function. It is well known that any...

0 Luiz E. Allem, et al. ∙

research

∙ 10/29/2018

Reducing the complexity for class group computations using small defining polynomials

In this paper, we describe an algorithm that efficiently collect relatio...

0 Alexandre Gélin, et al. ∙

research

∙ 06/07/2023

On Isolating Roots in a Multiple Field Extension

We address univariate root isolation when the polynomial's coefficients ...

0 Christina Katsamaki, et al. ∙

research

∙ 05/08/2020

On the complexity of computing integral bases of function fields

Let 𝒞 be a plane curve given by an equation f(x,y)=0 with f∈ K[x][y] a m...

0 Simon Abelard, et al. ∙

research

∙ 03/28/2020

Making RooFit Ready for Run 3

RooFit and RooStats, the toolkits for statistical modelling in ROOT, are...

0 Stephan Hageboeck, et al. ∙