International audienceWe describe an algorithm which computes all subfields of an effectively given finite algebraic extension. Although the base field can be arbitrary, we focus our attention on the rationals. This appears to be a fundamental tool for the simplification of algebraic numbers
We study base field extensions of ordinary abelian varieties defined over finite fields using the mo...
We study base field extensions of ordinary abelian varieties defined over finite fields using the mo...
This paper presents an explicit bound on the number of primitive elements that are linear combinatio...
Several mathematical results and new computational methods are presented for primitive elements and ...
AbstractThe algorithms presented here make use of subfield information to improve computations. For ...
Several mathematical results and new computational methods are presented for primitive elements and ...
Given a field F and elements \alpha and \beta not in F, then F(\alpha, \beta) is the smallest field ...
AbstractBy means of Gröbner basis techniques algorithms for solving various problems concerning subf...
Given a field extension K/k of degree n we are interested in finding the subfields of K containing k...
AbstractOne of the main contributions which Volker Weispfenning made to mathematics is related to Gr...
Given a field F and elements α and β not in F, then F(α, β) is the smallest field containing α,β, an...
AbstractWe give a conjectural deterministic algorithm for computing primitive elements of extensions...
By means of Groebner basis techniques algorithms for solving various problems concerning subfields K...
An algebraic number field is a finite extension of Q; an algebraic number is an element of an algebr...
An algebraic number field is a finite extension of Q; an algebraic number is an element of an algebr...
We study base field extensions of ordinary abelian varieties defined over finite fields using the mo...
We study base field extensions of ordinary abelian varieties defined over finite fields using the mo...
This paper presents an explicit bound on the number of primitive elements that are linear combinatio...
Several mathematical results and new computational methods are presented for primitive elements and ...
AbstractThe algorithms presented here make use of subfield information to improve computations. For ...
Several mathematical results and new computational methods are presented for primitive elements and ...
Given a field F and elements \alpha and \beta not in F, then F(\alpha, \beta) is the smallest field ...
AbstractBy means of Gröbner basis techniques algorithms for solving various problems concerning subf...
Given a field extension K/k of degree n we are interested in finding the subfields of K containing k...
AbstractOne of the main contributions which Volker Weispfenning made to mathematics is related to Gr...
Given a field F and elements α and β not in F, then F(α, β) is the smallest field containing α,β, an...
AbstractWe give a conjectural deterministic algorithm for computing primitive elements of extensions...
By means of Groebner basis techniques algorithms for solving various problems concerning subfields K...
An algebraic number field is a finite extension of Q; an algebraic number is an element of an algebr...
An algebraic number field is a finite extension of Q; an algebraic number is an element of an algebr...
We study base field extensions of ordinary abelian varieties defined over finite fields using the mo...
We study base field extensions of ordinary abelian varieties defined over finite fields using the mo...
This paper presents an explicit bound on the number of primitive elements that are linear combinatio...
DOI
Add to ORKG