---
_id: '34843'
abstract:
- lang: eng
  text: "A polynomial time algorithm to find generators of the lattice of all subfields
    of a given number field was given in van Hoeij et al. (2013).\r\n\r\nThis article
    reports on a massive speedup of this algorithm. This is primary achieved by our
    new concept of Galois-generating subfields. In general this is a very small set
    of subfields that determine all other subfields in a group-theoretic way. We compute
    them by targeted calls to the method from van Hoeij et al. (2013). For an early
    termination of these calls, we give a list of criteria that imply that further
    calls will not result in additional subfields.\r\n\r\nFinally, we explain how
    we use subfields to get a good starting group for the computation of Galois groups."
author:
- first_name: Andreas-Stephan
  full_name: Elsenhans, Andreas-Stephan
  last_name: Elsenhans
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
citation:
  ama: Elsenhans A-S, Klüners J. Computing subfields of number fields and applications
    to Galois group computations. <i>Journal of Symbolic Computation</i>. 2018;93:1-20.
    doi:<a href="https://doi.org/10.1016/j.jsc.2018.04.013">10.1016/j.jsc.2018.04.013</a>
  apa: Elsenhans, A.-S., &#38; Klüners, J. (2018). Computing subfields of number fields
    and applications to Galois group computations. <i>Journal of Symbolic Computation</i>,
    <i>93</i>, 1–20. <a href="https://doi.org/10.1016/j.jsc.2018.04.013">https://doi.org/10.1016/j.jsc.2018.04.013</a>
  bibtex: '@article{Elsenhans_Klüners_2018, title={Computing subfields of number fields
    and applications to Galois group computations}, volume={93}, DOI={<a href="https://doi.org/10.1016/j.jsc.2018.04.013">10.1016/j.jsc.2018.04.013</a>},
    journal={Journal of Symbolic Computation}, publisher={Elsevier BV}, author={Elsenhans,
    Andreas-Stephan and Klüners, Jürgen}, year={2018}, pages={1–20} }'
  chicago: 'Elsenhans, Andreas-Stephan, and Jürgen Klüners. “Computing Subfields of
    Number Fields and Applications to Galois Group Computations.” <i>Journal of Symbolic
    Computation</i> 93 (2018): 1–20. <a href="https://doi.org/10.1016/j.jsc.2018.04.013">https://doi.org/10.1016/j.jsc.2018.04.013</a>.'
  ieee: 'A.-S. Elsenhans and J. Klüners, “Computing subfields of number fields and
    applications to Galois group computations,” <i>Journal of Symbolic Computation</i>,
    vol. 93, pp. 1–20, 2018, doi: <a href="https://doi.org/10.1016/j.jsc.2018.04.013">10.1016/j.jsc.2018.04.013</a>.'
  mla: Elsenhans, Andreas-Stephan, and Jürgen Klüners. “Computing Subfields of Number
    Fields and Applications to Galois Group Computations.” <i>Journal of Symbolic
    Computation</i>, vol. 93, Elsevier BV, 2018, pp. 1–20, doi:<a href="https://doi.org/10.1016/j.jsc.2018.04.013">10.1016/j.jsc.2018.04.013</a>.
  short: A.-S. Elsenhans, J. Klüners, Journal of Symbolic Computation 93 (2018) 1–20.
date_created: 2022-12-22T10:52:18Z
date_updated: 2023-03-06T09:05:51Z
department:
- _id: '102'
doi: 10.1016/j.jsc.2018.04.013
external_id:
  arxiv:
  - '1610.06837 '
intvolume: '        93'
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 1-20
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: Computing subfields of number fields and applications to Galois group computations
type: journal_article
user_id: '93826'
volume: 93
year: '2018'
...
---
_id: '34846'
abstract:
- lang: eng
  text: Given a field extension K/k of degree n we are interested in finding the subfields
    of K containing k. There can be more than polynomially many subfields. We introduce
    the notion of generating subfields, a set of up to n subfields whose intersections
    give the rest. We provide an efficient algorithm which uses linear algebra in
    k or lattice reduction along with factorization in any extension of K. Implementations
    show that previously difficult cases can now be handled.
author:
- first_name: Mark
  full_name: van Hoeij, Mark
  last_name: van Hoeij
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
- first_name: Andrew
  full_name: Novocin, Andrew
  last_name: Novocin
citation:
  ama: van Hoeij M, Klüners J, Novocin A. Generating subfields. <i>Journal of Symbolic
    Computation</i>. 2011;52:17-34. doi:<a href="https://doi.org/10.1016/j.jsc.2012.05.010">10.1016/j.jsc.2012.05.010</a>
  apa: van Hoeij, M., Klüners, J., &#38; Novocin, A. (2011). Generating subfields.
    <i>Journal of Symbolic Computation</i>, <i>52</i>, 17–34. <a href="https://doi.org/10.1016/j.jsc.2012.05.010">https://doi.org/10.1016/j.jsc.2012.05.010</a>
  bibtex: '@article{van Hoeij_Klüners_Novocin_2011, title={Generating subfields},
    volume={52}, DOI={<a href="https://doi.org/10.1016/j.jsc.2012.05.010">10.1016/j.jsc.2012.05.010</a>},
    journal={Journal of Symbolic Computation}, publisher={Elsevier BV}, author={van
    Hoeij, Mark and Klüners, Jürgen and Novocin, Andrew}, year={2011}, pages={17–34}
    }'
  chicago: 'Hoeij, Mark van, Jürgen Klüners, and Andrew Novocin. “Generating Subfields.”
    <i>Journal of Symbolic Computation</i> 52 (2011): 17–34. <a href="https://doi.org/10.1016/j.jsc.2012.05.010">https://doi.org/10.1016/j.jsc.2012.05.010</a>.'
  ieee: 'M. van Hoeij, J. Klüners, and A. Novocin, “Generating subfields,” <i>Journal
    of Symbolic Computation</i>, vol. 52, pp. 17–34, 2011, doi: <a href="https://doi.org/10.1016/j.jsc.2012.05.010">10.1016/j.jsc.2012.05.010</a>.'
  mla: van Hoeij, Mark, et al. “Generating Subfields.” <i>Journal of Symbolic Computation</i>,
    vol. 52, Elsevier BV, 2011, pp. 17–34, doi:<a href="https://doi.org/10.1016/j.jsc.2012.05.010">10.1016/j.jsc.2012.05.010</a>.
  short: M. van Hoeij, J. Klüners, A. Novocin, Journal of Symbolic Computation 52
    (2011) 17–34.
date_created: 2022-12-22T10:54:15Z
date_updated: 2023-03-06T09:46:15Z
department:
- _id: '102'
doi: 10.1016/j.jsc.2012.05.010
intvolume: '        52'
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 17-34
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: Generating subfields
type: journal_article
user_id: '93826'
volume: 52
year: '2011'
...
---
_id: '34900'
abstract:
- lang: eng
  text: We describe methods for the computation of Galois groups of univariate polynomials
    over the rationals which we have implemented up to degree 15. These methods are
    based on Stauduhar’s algorithm. All computations are done in unramified p -adic
    extensions. For imprimitive groups we give an improvement using subfields. In
    the primitive case we use known subgroups of the Galois group together with a
    combination of Stauduhar’s method and the absolute resolvent method.
author:
- first_name: Katharina
  full_name: Geissler, Katharina
  last_name: Geissler
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
citation:
  ama: Geissler K, Klüners J. Galois Group Computation for Rational Polynomials. <i>Journal
    of Symbolic Computation</i>. 2000;30(6):653-674. doi:<a href="https://doi.org/10.1006/jsco.2000.0377">10.1006/jsco.2000.0377</a>
  apa: Geissler, K., &#38; Klüners, J. (2000). Galois Group Computation for Rational
    Polynomials. <i>Journal of Symbolic Computation</i>, <i>30</i>(6), 653–674. <a
    href="https://doi.org/10.1006/jsco.2000.0377">https://doi.org/10.1006/jsco.2000.0377</a>
  bibtex: '@article{Geissler_Klüners_2000, title={Galois Group Computation for Rational
    Polynomials}, volume={30}, DOI={<a href="https://doi.org/10.1006/jsco.2000.0377">10.1006/jsco.2000.0377</a>},
    number={6}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={Geissler, Katharina and Klüners, Jürgen}, year={2000}, pages={653–674}
    }'
  chicago: 'Geissler, Katharina, and Jürgen Klüners. “Galois Group Computation for
    Rational Polynomials.” <i>Journal of Symbolic Computation</i> 30, no. 6 (2000):
    653–74. <a href="https://doi.org/10.1006/jsco.2000.0377">https://doi.org/10.1006/jsco.2000.0377</a>.'
  ieee: 'K. Geissler and J. Klüners, “Galois Group Computation for Rational Polynomials,”
    <i>Journal of Symbolic Computation</i>, vol. 30, no. 6, pp. 653–674, 2000, doi:
    <a href="https://doi.org/10.1006/jsco.2000.0377">10.1006/jsco.2000.0377</a>.'
  mla: Geissler, Katharina, and Jürgen Klüners. “Galois Group Computation for Rational
    Polynomials.” <i>Journal of Symbolic Computation</i>, vol. 30, no. 6, Elsevier
    BV, 2000, pp. 653–74, doi:<a href="https://doi.org/10.1006/jsco.2000.0377">10.1006/jsco.2000.0377</a>.
  short: K. Geissler, J. Klüners, Journal of Symbolic Computation 30 (2000) 653–674.
date_created: 2022-12-23T09:58:16Z
date_updated: 2023-03-06T09:58:06Z
department:
- _id: '102'
doi: 10.1006/jsco.2000.0377
intvolume: '        30'
issue: '6'
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 653-674
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: Galois Group Computation for Rational Polynomials
type: journal_article
user_id: '93826'
volume: 30
year: '2000'
...
---
_id: '34901'
abstract:
- lang: eng
  text: Let L = K(α) be an Abelian extension of degree n of a number field K, given
    by the minimal polynomial of α over K. We describe an algorithm for computing
    the local Artin map associated with the extension L / K at a finite or infinite
    prime v of K. We apply this algorithm to decide if a nonzero a ∈ K is a norm from
    L, assuming that L / K is cyclic.
author:
- first_name: Vincenzo
  full_name: Acciaro, Vincenzo
  last_name: Acciaro
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
citation:
  ama: Acciaro V, Klüners J. Computing Local Artin Maps, and Solvability of Norm Equations.
    <i>Journal of Symbolic Computation</i>. 2000;30(3):239-252. doi:<a href="https://doi.org/10.1006/jsco.2000.0361">10.1006/jsco.2000.0361</a>
  apa: Acciaro, V., &#38; Klüners, J. (2000). Computing Local Artin Maps, and Solvability
    of Norm Equations. <i>Journal of Symbolic Computation</i>, <i>30</i>(3), 239–252.
    <a href="https://doi.org/10.1006/jsco.2000.0361">https://doi.org/10.1006/jsco.2000.0361</a>
  bibtex: '@article{Acciaro_Klüners_2000, title={Computing Local Artin Maps, and Solvability
    of Norm Equations}, volume={30}, DOI={<a href="https://doi.org/10.1006/jsco.2000.0361">10.1006/jsco.2000.0361</a>},
    number={3}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={Acciaro, Vincenzo and Klüners, Jürgen}, year={2000}, pages={239–252} }'
  chicago: 'Acciaro, Vincenzo, and Jürgen Klüners. “Computing Local Artin Maps, and
    Solvability of Norm Equations.” <i>Journal of Symbolic Computation</i> 30, no.
    3 (2000): 239–52. <a href="https://doi.org/10.1006/jsco.2000.0361">https://doi.org/10.1006/jsco.2000.0361</a>.'
  ieee: 'V. Acciaro and J. Klüners, “Computing Local Artin Maps, and Solvability of
    Norm Equations,” <i>Journal of Symbolic Computation</i>, vol. 30, no. 3, pp. 239–252,
    2000, doi: <a href="https://doi.org/10.1006/jsco.2000.0361">10.1006/jsco.2000.0361</a>.'
  mla: Acciaro, Vincenzo, and Jürgen Klüners. “Computing Local Artin Maps, and Solvability
    of Norm Equations.” <i>Journal of Symbolic Computation</i>, vol. 30, no. 3, Elsevier
    BV, 2000, pp. 239–52, doi:<a href="https://doi.org/10.1006/jsco.2000.0361">10.1006/jsco.2000.0361</a>.
  short: V. Acciaro, J. Klüners, Journal of Symbolic Computation 30 (2000) 239–252.
date_created: 2022-12-23T09:58:48Z
date_updated: 2023-03-06T09:57:34Z
department:
- _id: '102'
doi: 10.1006/jsco.2000.0361
intvolume: '        30'
issue: '3'
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 239-252
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: Computing Local Artin Maps, and Solvability of Norm Equations
type: journal_article
user_id: '93826'
volume: 30
year: '2000'
...
---
_id: '34899'
abstract:
- lang: eng
  text: We describe methods for the construction of polynomials with certain types
    of Galois groups. As an application we deduce that all transitive groups G up
    to degree 15 occur as Galois groups of regular extensions of ℚ (t), and in each
    case compute a polynomial f ∈ ℚ [ x ] with Gal(f)  = G.
author:
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
- first_name: Gunter
  full_name: Malle, Gunter
  last_name: Malle
citation:
  ama: Klüners J, Malle G. Explicit Galois Realization of Transitive Groups of Degree
    up to 15. <i>Journal of Symbolic Computation</i>. 2000;30(6):675-716. doi:<a href="https://doi.org/10.1006/jsco.2000.0378">10.1006/jsco.2000.0378</a>
  apa: Klüners, J., &#38; Malle, G. (2000). Explicit Galois Realization of Transitive
    Groups of Degree up to 15. <i>Journal of Symbolic Computation</i>, <i>30</i>(6),
    675–716. <a href="https://doi.org/10.1006/jsco.2000.0378">https://doi.org/10.1006/jsco.2000.0378</a>
  bibtex: '@article{Klüners_Malle_2000, title={Explicit Galois Realization of Transitive
    Groups of Degree up to 15}, volume={30}, DOI={<a href="https://doi.org/10.1006/jsco.2000.0378">10.1006/jsco.2000.0378</a>},
    number={6}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={Klüners, Jürgen and Malle, Gunter}, year={2000}, pages={675–716} }'
  chicago: 'Klüners, Jürgen, and Gunter Malle. “Explicit Galois Realization of Transitive
    Groups of Degree up to 15.” <i>Journal of Symbolic Computation</i> 30, no. 6 (2000):
    675–716. <a href="https://doi.org/10.1006/jsco.2000.0378">https://doi.org/10.1006/jsco.2000.0378</a>.'
  ieee: 'J. Klüners and G. Malle, “Explicit Galois Realization of Transitive Groups
    of Degree up to 15,” <i>Journal of Symbolic Computation</i>, vol. 30, no. 6, pp.
    675–716, 2000, doi: <a href="https://doi.org/10.1006/jsco.2000.0378">10.1006/jsco.2000.0378</a>.'
  mla: Klüners, Jürgen, and Gunter Malle. “Explicit Galois Realization of Transitive
    Groups of Degree up to 15.” <i>Journal of Symbolic Computation</i>, vol. 30, no.
    6, Elsevier BV, 2000, pp. 675–716, doi:<a href="https://doi.org/10.1006/jsco.2000.0378">10.1006/jsco.2000.0378</a>.
  short: J. Klüners, G. Malle, Journal of Symbolic Computation 30 (2000) 675–716.
date_created: 2022-12-23T09:57:28Z
date_updated: 2023-03-06T10:48:05Z
department:
- _id: '102'
doi: 10.1006/jsco.2000.0378
intvolume: '        30'
issue: '6'
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 675-716
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: Explicit Galois Realization of Transitive Groups of Degree up to 15
type: journal_article
user_id: '93826'
volume: 30
year: '2000'
...
---
_id: '34898'
abstract:
- lang: eng
  text: We compute a polynomial with Galois group SL₂(11) over ℚ. Furthermore we prove
    that SL₂(11) is the Galois group of a regular extension of ℚ (t).
author:
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
citation:
  ama: Klüners J. A Polynomial with Galois GroupSL2(11). <i>Journal of Symbolic Computation</i>.
    2000;30(6):733-737. doi:<a href="https://doi.org/10.1006/jsco.2000.0380">10.1006/jsco.2000.0380</a>
  apa: Klüners, J. (2000). A Polynomial with Galois GroupSL2(11). <i>Journal of Symbolic
    Computation</i>, <i>30</i>(6), 733–737. <a href="https://doi.org/10.1006/jsco.2000.0380">https://doi.org/10.1006/jsco.2000.0380</a>
  bibtex: '@article{Klüners_2000, title={A Polynomial with Galois GroupSL2(11)}, volume={30},
    DOI={<a href="https://doi.org/10.1006/jsco.2000.0380">10.1006/jsco.2000.0380</a>},
    number={6}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={Klüners, Jürgen}, year={2000}, pages={733–737} }'
  chicago: 'Klüners, Jürgen. “A Polynomial with Galois GroupSL2(11).” <i>Journal of
    Symbolic Computation</i> 30, no. 6 (2000): 733–37. <a href="https://doi.org/10.1006/jsco.2000.0380">https://doi.org/10.1006/jsco.2000.0380</a>.'
  ieee: 'J. Klüners, “A Polynomial with Galois GroupSL2(11),” <i>Journal of Symbolic
    Computation</i>, vol. 30, no. 6, pp. 733–737, 2000, doi: <a href="https://doi.org/10.1006/jsco.2000.0380">10.1006/jsco.2000.0380</a>.'
  mla: Klüners, Jürgen. “A Polynomial with Galois GroupSL2(11).” <i>Journal of Symbolic
    Computation</i>, vol. 30, no. 6, Elsevier BV, 2000, pp. 733–37, doi:<a href="https://doi.org/10.1006/jsco.2000.0380">10.1006/jsco.2000.0380</a>.
  short: J. Klüners, Journal of Symbolic Computation 30 (2000) 733–737.
date_created: 2022-12-23T09:56:52Z
date_updated: 2023-03-06T10:48:40Z
department:
- _id: '102'
doi: 10.1006/jsco.2000.0380
intvolume: '        30'
issue: '6'
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 733-737
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: A Polynomial with Galois GroupSL2(11)
type: journal_article
user_id: '93826'
volume: 30
year: '2000'
...
---
_id: '34902'
abstract:
- lang: eng
  text: We present a new polynomial decomposition which generalizes the functional
    and homogeneous bivariate decomposition of irreducible monic polynomials in one
    variable over the rationals. With these decompositions it is possible to calculate
    the roots of an imprimitive polynomial by solving polynomial equations of lower
    degree.
author:
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
citation:
  ama: Klüners J. On Polynomial Decompositions. <i>Journal of Symbolic Computation</i>.
    1999;27(3):261-269. doi:<a href="https://doi.org/10.1006/jsco.1998.0252">10.1006/jsco.1998.0252</a>
  apa: Klüners, J. (1999). On Polynomial Decompositions. <i>Journal of Symbolic Computation</i>,
    <i>27</i>(3), 261–269. <a href="https://doi.org/10.1006/jsco.1998.0252">https://doi.org/10.1006/jsco.1998.0252</a>
  bibtex: '@article{Klüners_1999, title={On Polynomial Decompositions}, volume={27},
    DOI={<a href="https://doi.org/10.1006/jsco.1998.0252">10.1006/jsco.1998.0252</a>},
    number={3}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={Klüners, Jürgen}, year={1999}, pages={261–269} }'
  chicago: 'Klüners, Jürgen. “On Polynomial Decompositions.” <i>Journal of Symbolic
    Computation</i> 27, no. 3 (1999): 261–69. <a href="https://doi.org/10.1006/jsco.1998.0252">https://doi.org/10.1006/jsco.1998.0252</a>.'
  ieee: 'J. Klüners, “On Polynomial Decompositions,” <i>Journal of Symbolic Computation</i>,
    vol. 27, no. 3, pp. 261–269, 1999, doi: <a href="https://doi.org/10.1006/jsco.1998.0252">10.1006/jsco.1998.0252</a>.'
  mla: Klüners, Jürgen. “On Polynomial Decompositions.” <i>Journal of Symbolic Computation</i>,
    vol. 27, no. 3, Elsevier BV, 1999, pp. 261–69, doi:<a href="https://doi.org/10.1006/jsco.1998.0252">10.1006/jsco.1998.0252</a>.
  short: J. Klüners, Journal of Symbolic Computation 27 (1999) 261–269.
date_created: 2022-12-23T10:01:15Z
date_updated: 2023-03-06T09:21:29Z
department:
- _id: '102'
doi: 10.1006/jsco.1998.0252
intvolume: '        27'
issue: '3'
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 261-269
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: On Polynomial Decompositions
type: journal_article
user_id: '93826'
volume: 27
year: '1999'
...
---
_id: '34903'
abstract:
- lang: eng
  text: The software packageKANT V4for computations in algebraic number fields is
    now available in version 4. In addition a new user interface has been released.
    We will outline the features of this new software package.
author:
- first_name: M.
  full_name: DABERKOW, M.
  last_name: DABERKOW
- first_name: C.
  full_name: FIEKER, C.
  last_name: FIEKER
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
- first_name: M.
  full_name: POHST, M.
  last_name: POHST
- first_name: K.
  full_name: ROEGNER, K.
  last_name: ROEGNER
- first_name: M.
  full_name: SCHÖRNIG, M.
  last_name: SCHÖRNIG
- first_name: K.
  full_name: WILDANGER, K.
  last_name: WILDANGER
citation:
  ama: DABERKOW M, FIEKER C, Klüners J, et al. KANT V4. <i>Journal of Symbolic Computation</i>.
    1997;24(3-4):267-283. doi:<a href="https://doi.org/10.1006/jsco.1996.0126">10.1006/jsco.1996.0126</a>
  apa: DABERKOW, M., FIEKER, C., Klüners, J., POHST, M., ROEGNER, K., SCHÖRNIG, M.,
    &#38; WILDANGER, K. (1997). KANT V4. <i>Journal of Symbolic Computation</i>, <i>24</i>(3–4),
    267–283. <a href="https://doi.org/10.1006/jsco.1996.0126">https://doi.org/10.1006/jsco.1996.0126</a>
  bibtex: '@article{DABERKOW_FIEKER_Klüners_POHST_ROEGNER_SCHÖRNIG_WILDANGER_1997,
    title={KANT V4}, volume={24}, DOI={<a href="https://doi.org/10.1006/jsco.1996.0126">10.1006/jsco.1996.0126</a>},
    number={3–4}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={DABERKOW, M. and FIEKER, C. and Klüners, Jürgen and POHST, M. and ROEGNER,
    K. and SCHÖRNIG, M. and WILDANGER, K.}, year={1997}, pages={267–283} }'
  chicago: 'DABERKOW, M., C. FIEKER, Jürgen Klüners, M. POHST, K. ROEGNER, M. SCHÖRNIG,
    and K. WILDANGER. “KANT V4.” <i>Journal of Symbolic Computation</i> 24, no. 3–4
    (1997): 267–83. <a href="https://doi.org/10.1006/jsco.1996.0126">https://doi.org/10.1006/jsco.1996.0126</a>.'
  ieee: 'M. DABERKOW <i>et al.</i>, “KANT V4,” <i>Journal of Symbolic Computation</i>,
    vol. 24, no. 3–4, pp. 267–283, 1997, doi: <a href="https://doi.org/10.1006/jsco.1996.0126">10.1006/jsco.1996.0126</a>.'
  mla: DABERKOW, M., et al. “KANT V4.” <i>Journal of Symbolic Computation</i>, vol.
    24, no. 3–4, Elsevier BV, 1997, pp. 267–83, doi:<a href="https://doi.org/10.1006/jsco.1996.0126">10.1006/jsco.1996.0126</a>.
  short: M. DABERKOW, C. FIEKER, J. Klüners, M. POHST, K. ROEGNER, M. SCHÖRNIG, K.
    WILDANGER, Journal of Symbolic Computation 24 (1997) 267–283.
date_created: 2022-12-23T10:02:24Z
date_updated: 2023-03-06T09:23:30Z
ddc:
- '000'
department:
- _id: '102'
doi: 10.1006/jsco.1996.0126
has_accepted_license: '1'
intvolume: '        24'
issue: 3-4
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 267-283
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: KANT V4
type: journal_article
user_id: '93826'
volume: 24
year: '1997'
...
---
_id: '34904'
abstract:
- lang: eng
  text: The purpose of this article is to determine all subfields ℚ(β) of fixed degree
    of a given algebraic number field ℚ(α). It is convenient to describe each subfield
    by a pair (h,g) of polynomials in ℚ[t] resp. Z[t] such thatgis the minimal polynomial
    of β = h(α). The computations are done in unramifiedp-adic extensions and use
    information concerning subgroups of the Galois group of the normal closure of
    ℚ(α) obtained from the van der Waerden criterion.
author:
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
- first_name: Michael
  full_name: Pohst, Michael
  last_name: Pohst
citation:
  ama: Klüners J, Pohst M. On Computing Subfields. <i>Journal of Symbolic Computation</i>.
    1997;24(3-4):385-397. doi:<a href="https://doi.org/10.1006/jsco.1996.0140">10.1006/jsco.1996.0140</a>
  apa: Klüners, J., &#38; Pohst, M. (1997). On Computing Subfields. <i>Journal of
    Symbolic Computation</i>, <i>24</i>(3–4), 385–397. <a href="https://doi.org/10.1006/jsco.1996.0140">https://doi.org/10.1006/jsco.1996.0140</a>
  bibtex: '@article{Klüners_Pohst_1997, title={On Computing Subfields}, volume={24},
    DOI={<a href="https://doi.org/10.1006/jsco.1996.0140">10.1006/jsco.1996.0140</a>},
    number={3–4}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={Klüners, Jürgen and Pohst, Michael}, year={1997}, pages={385–397} }'
  chicago: 'Klüners, Jürgen, and Michael Pohst. “On Computing Subfields.” <i>Journal
    of Symbolic Computation</i> 24, no. 3–4 (1997): 385–97. <a href="https://doi.org/10.1006/jsco.1996.0140">https://doi.org/10.1006/jsco.1996.0140</a>.'
  ieee: 'J. Klüners and M. Pohst, “On Computing Subfields,” <i>Journal of Symbolic
    Computation</i>, vol. 24, no. 3–4, pp. 385–397, 1997, doi: <a href="https://doi.org/10.1006/jsco.1996.0140">10.1006/jsco.1996.0140</a>.'
  mla: Klüners, Jürgen, and Michael Pohst. “On Computing Subfields.” <i>Journal of
    Symbolic Computation</i>, vol. 24, no. 3–4, Elsevier BV, 1997, pp. 385–97, doi:<a
    href="https://doi.org/10.1006/jsco.1996.0140">10.1006/jsco.1996.0140</a>.
  short: J. Klüners, M. Pohst, Journal of Symbolic Computation 24 (1997) 385–397.
date_created: 2022-12-23T10:03:02Z
date_updated: 2023-03-06T10:36:21Z
ddc:
- '000'
department:
- _id: '102'
doi: 10.1006/jsco.1996.0140
has_accepted_license: '1'
intvolume: '        24'
issue: 3-4
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 385-397
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: On Computing Subfields
type: journal_article
user_id: '93826'
volume: 24
year: '1997'
...