Jürgen Klüners
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Jürgen Klüners has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Vincenzo Acciaro
Department of Economic Studies, G. d’Annunzio University of Chieti-Pescara, Viale Pindaro, 42, 65127 Pescara, Italy
2 shared publications - Gunter Malle
TU Kaiserslautern
1 shared publication
Latest Publications
- Open Access
- 1 January 2001
- Published by Wiley in LMS Journal of Computation and Mathematics
- Vol. 4, 182-196
A Database for Field Extensions of the Rationals
This paper announces the creation of a database for number fields. It describes the contents and the methods of access, indicates the origin of the polynomials, and formulates the aims of this collection of fields.
- 1 January 2001
- Published by Wiley in LMS Journal of Computation and Mathematics
- Vol. 4, 182-196
Open AccessA Database for Field Extensions of the Rationals
This paper announces the creation of a database for number fields. It describes the contents and the methods of access, indicates the origin of the polynomials, and formulates the aims of this collection of fields.
- 1 September 2000
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 30 (3) , 239-252
Computing Local Artin Maps, and Solvability of Norm Equations
- 1 September 2000
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 30 (3) , 239-252
Computing Local Artin Maps, and Solvability of Norm Equations
- 1 March 1999
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 27 (3) , 261-269
On Polynomial Decompositions
- 1 March 1999
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 27 (3) , 261-269
On Polynomial Decompositions
- Open Access
- 8 February 1999
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 68 (227) , 1179-1186
Computing automorphisms of abelian number fields
Let L = Q ( α ) L=\mathbb {Q}(\alpha ) be an abelian number field of degree n n . Most algorithms for computing the lattice of subfields of L L require the computation of all the conjugates of α \alpha . This is usually achieved by factoring the minimal polynomial m α ( x ) m_{\alpha }(x) of α \alpha over L L . In practice, the existing algorithms for factoring polynomials over algebraic number fields can handle only problems of moderate size. In this paper we describe a fast probabilistic algorithm for computing the conjugates of α \alpha , which is based on p p -adic techniques. Given m α ( x ) m_{\alpha }(x) and a rational prime p p which does not divide the discriminant disc ( m α ( x ) ) \operatorname {disc} (m_{\alpha }(x)) of m α ( x ) m_{\alpha }(x) , the algorithm computes the Frobenius automorphism of p p in time polynomial in the size of p p and in the size of m α ( x ) m_{\alpha }(x) . By repeatedly applying the algorithm to randomly chosen primes it is possible to compute all the conjugates of α \alpha .
- 8 February 1999
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 68 (227) , 1179-1186
Open AccessComputing automorphisms of abelian number fields
Let L = Q ( α ) L=\mathbb {Q}(\alpha ) be an abelian number field of degree n n . Most algorithms for computing the lattice of subfields of L L require the computation of all the conjugates of α \alpha . This is usually achieved by factoring the minimal polynomial m α ( x ) m_{\alpha }(x) of α \alpha over L L . In practice, the existing algorithms for factoring polynomials over algebraic number fields can handle only problems of moderate size. In this paper we describe a fast probabilistic algorithm for computing the conjugates of α \alpha , which is based on p p -adic techniques. Given m α ( x ) m_{\alpha }(x) and a rational prime p p which does not divide the discriminant disc ( m α ( x ) ) \operatorname {disc} (m_{\alpha }(x)) of m α ( x ) m_{\alpha }(x) , the algorithm computes the Frobenius automorphism of p p in time polynomial in the size of p p and in the size of m α ( x ) m_{\alpha }(x) . By repeatedly applying the algorithm to randomly chosen primes it is possible to compute all the conjugates of α \alpha .