@article{34899,
  abstract     = {{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       = {{Klüners, Jürgen and Malle, Gunter}},
  issn         = {{0747-7171}},
  journal      = {{Journal of Symbolic Computation}},
  keywords     = {{Computational Mathematics, Algebra and Number Theory}},
  number       = {{6}},
  pages        = {{675--716}},
  publisher    = {{Elsevier BV}},
  title        = {{{Explicit Galois Realization of Transitive Groups of Degree up to 15}}},
  doi          = {{10.1006/jsco.2000.0378}},
  volume       = {{30}},
  year         = {{2000}},
}

@article{34898,
  abstract     = {{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       = {{Klüners, Jürgen}},
  issn         = {{0747-7171}},
  journal      = {{Journal of Symbolic Computation}},
  keywords     = {{Computational Mathematics, Algebra and Number Theory}},
  number       = {{6}},
  pages        = {{733--737}},
  publisher    = {{Elsevier BV}},
  title        = {{{A Polynomial with Galois GroupSL2(11)}}},
  doi          = {{10.1006/jsco.2000.0380}},
  volume       = {{30}},
  year         = {{2000}},
}

@article{34902,
  abstract     = {{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       = {{Klüners, Jürgen}},
  issn         = {{0747-7171}},
  journal      = {{Journal of Symbolic Computation}},
  keywords     = {{Computational Mathematics, Algebra and Number Theory}},
  number       = {{3}},
  pages        = {{261--269}},
  publisher    = {{Elsevier BV}},
  title        = {{{On Polynomial Decompositions}}},
  doi          = {{10.1006/jsco.1998.0252}},
  volume       = {{27}},
  year         = {{1999}},
}

@article{34903,
  abstract     = {{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       = {{DABERKOW, M. and FIEKER, C. and Klüners, Jürgen and POHST, M. and ROEGNER, K. and SCHÖRNIG, M. and WILDANGER, K.}},
  issn         = {{0747-7171}},
  journal      = {{Journal of Symbolic Computation}},
  keywords     = {{Computational Mathematics, Algebra and Number Theory}},
  number       = {{3-4}},
  pages        = {{267--283}},
  publisher    = {{Elsevier BV}},
  title        = {{{KANT V4}}},
  doi          = {{10.1006/jsco.1996.0126}},
  volume       = {{24}},
  year         = {{1997}},
}

@article{34904,
  abstract     = {{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       = {{Klüners, Jürgen and Pohst, Michael}},
  issn         = {{0747-7171}},
  journal      = {{Journal of Symbolic Computation}},
  keywords     = {{Computational Mathematics, Algebra and Number Theory}},
  number       = {{3-4}},
  pages        = {{385--397}},
  publisher    = {{Elsevier BV}},
  title        = {{{On Computing Subfields}}},
  doi          = {{10.1006/jsco.1996.0140}},
  volume       = {{24}},
  year         = {{1997}},
}

