[{"citation":{"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>.","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>","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} }","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>","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>.","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>.","short":"J. Klüners, G. Malle, Journal of Symbolic Computation 30 (2000) 675–716."},"status":"public","volume":30,"user_id":"93826","_id":"34899","publisher":"Elsevier BV","page":"675-716","abstract":[{"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.","lang":"eng"}],"publication":"Journal of Symbolic Computation","issue":"6","department":[{"_id":"102"}],"type":"journal_article","keyword":["Computational Mathematics","Algebra and Number Theory"],"date_created":"2022-12-23T09:57:28Z","intvolume":"        30","date_updated":"2023-03-06T10:48:05Z","publication_status":"published","author":[{"full_name":"Klüners, Jürgen","last_name":"Klüners","first_name":"Jürgen","id":"21202"},{"full_name":"Malle, Gunter","first_name":"Gunter","last_name":"Malle"}],"publication_identifier":{"issn":["0747-7171"]},"title":"Explicit Galois Realization of Transitive Groups of Degree up to 15","year":"2000","doi":"10.1006/jsco.2000.0378","language":[{"iso":"eng"}]},{"publication":"Journal of Symbolic Computation","issue":"6","abstract":[{"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).","lang":"eng"}],"date_created":"2022-12-23T09:56:52Z","department":[{"_id":"102"}],"type":"journal_article","keyword":["Computational Mathematics","Algebra and Number Theory"],"author":[{"first_name":"Jürgen","last_name":"Klüners","full_name":"Klüners, Jürgen","id":"21202"}],"publication_identifier":{"issn":["0747-7171"]},"title":"A Polynomial with Galois GroupSL2(11)","year":"2000","intvolume":"        30","date_updated":"2023-03-06T10:48:40Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1006/jsco.2000.0380","citation":{"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>.","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>","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>.","short":"J. Klüners, Journal of Symbolic Computation 30 (2000) 733–737.","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>.","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} }","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>"},"status":"public","_id":"34898","publisher":"Elsevier BV","page":"733-737","volume":30,"user_id":"93826"},{"citation":{"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>","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>.","short":"J. Klüners, Journal of Symbolic Computation 27 (1999) 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>.","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>.","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>","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} }"},"status":"public","page":"261-269","_id":"34902","publisher":"Elsevier BV","user_id":"93826","volume":27,"publication":"Journal of Symbolic Computation","issue":"3","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."}],"date_created":"2022-12-23T10:01:15Z","type":"journal_article","keyword":["Computational Mathematics","Algebra and Number Theory"],"department":[{"_id":"102"}],"title":"On Polynomial Decompositions","year":"1999","author":[{"id":"21202","first_name":"Jürgen","last_name":"Klüners","full_name":"Klüners, Jürgen"}],"publication_identifier":{"issn":["0747-7171"]},"date_updated":"2023-03-06T09:21:29Z","publication_status":"published","intvolume":"        27","language":[{"iso":"eng"}],"doi":"10.1006/jsco.1998.0252"},{"publication":"Journal of Symbolic Computation","issue":"3-4","abstract":[{"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.","lang":"eng"}],"date_created":"2022-12-23T10:02:24Z","department":[{"_id":"102"}],"keyword":["Computational Mathematics","Algebra and Number Theory"],"type":"journal_article","author":[{"full_name":"DABERKOW, M.","last_name":"DABERKOW","first_name":"M."},{"last_name":"FIEKER","first_name":"C.","full_name":"FIEKER, C."},{"id":"21202","full_name":"Klüners, Jürgen","first_name":"Jürgen","last_name":"Klüners"},{"full_name":"POHST, M.","first_name":"M.","last_name":"POHST"},{"full_name":"ROEGNER, K.","last_name":"ROEGNER","first_name":"K."},{"first_name":"M.","last_name":"SCHÖRNIG","full_name":"SCHÖRNIG, M."},{"last_name":"WILDANGER","first_name":"K.","full_name":"WILDANGER, K."}],"publication_identifier":{"issn":["0747-7171"]},"title":"KANT V4","year":"1997","intvolume":"        24","date_updated":"2023-03-06T09:23:30Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1006/jsco.1996.0126","citation":{"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>","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>.","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.","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>.","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>.","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>","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} }"},"status":"public","has_accepted_license":"1","_id":"34903","publisher":"Elsevier BV","page":"267-283","volume":24,"ddc":["000"],"user_id":"93826"},{"citation":{"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>.","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} }","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>","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>.","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>","short":"J. Klüners, M. Pohst, Journal of Symbolic Computation 24 (1997) 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>."},"has_accepted_license":"1","status":"public","volume":24,"user_id":"93826","ddc":["000"],"_id":"34904","publisher":"Elsevier BV","page":"385-397","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."}],"issue":"3-4","publication":"Journal of Symbolic Computation","department":[{"_id":"102"}],"type":"journal_article","keyword":["Computational Mathematics","Algebra and Number Theory"],"date_created":"2022-12-23T10:03:02Z","intvolume":"        24","publication_status":"published","date_updated":"2023-03-06T10:36:21Z","author":[{"id":"21202","last_name":"Klüners","first_name":"Jürgen","full_name":"Klüners, Jürgen"},{"full_name":"Pohst, Michael","first_name":"Michael","last_name":"Pohst"}],"publication_identifier":{"issn":["0747-7171"]},"year":"1997","title":"On Computing Subfields","doi":"10.1006/jsco.1996.0140","language":[{"iso":"eng"}]}]