[{"publisher":"Elsevier BV","date_updated":"2023-01-26T17:44:02Z","date_created":"2023-01-25T10:20:13Z","author":[{"full_name":"Rösler, Margit","id":"37390","last_name":"Rösler","first_name":"Margit"},{"full_name":"de Jeu, Marcel","last_name":"de Jeu","first_name":"Marcel"}],"volume":119,"title":"Asymptotic Analysis for the Dunkl Kernel","doi":"10.1006/jath.2002.3722","publication_status":"published","publication_identifier":{"issn":["0021-9045"]},"issue":"1","year":"2002","citation":{"mla":"Rösler, Margit, and Marcel de Jeu. “Asymptotic Analysis for the Dunkl Kernel.” <i>Journal of Approximation Theory</i>, vol. 119, no. 1, Elsevier BV, 2002, pp. 110–26, doi:<a href=\"https://doi.org/10.1006/jath.2002.3722\">10.1006/jath.2002.3722</a>.","bibtex":"@article{Rösler_de Jeu_2002, title={Asymptotic Analysis for the Dunkl Kernel}, volume={119}, DOI={<a href=\"https://doi.org/10.1006/jath.2002.3722\">10.1006/jath.2002.3722</a>}, number={1}, journal={Journal of Approximation Theory}, publisher={Elsevier BV}, author={Rösler, Margit and de Jeu, Marcel}, year={2002}, pages={110–126} }","short":"M. Rösler, M. de Jeu, Journal of Approximation Theory 119 (2002) 110–126.","apa":"Rösler, M., &#38; de Jeu, M. (2002). Asymptotic Analysis for the Dunkl Kernel. <i>Journal of Approximation Theory</i>, <i>119</i>(1), 110–126. <a href=\"https://doi.org/10.1006/jath.2002.3722\">https://doi.org/10.1006/jath.2002.3722</a>","chicago":"Rösler, Margit, and Marcel de Jeu. “Asymptotic Analysis for the Dunkl Kernel.” <i>Journal of Approximation Theory</i> 119, no. 1 (2002): 110–26. <a href=\"https://doi.org/10.1006/jath.2002.3722\">https://doi.org/10.1006/jath.2002.3722</a>.","ieee":"M. Rösler and M. de Jeu, “Asymptotic Analysis for the Dunkl Kernel,” <i>Journal of Approximation Theory</i>, vol. 119, no. 1, pp. 110–126, 2002, doi: <a href=\"https://doi.org/10.1006/jath.2002.3722\">10.1006/jath.2002.3722</a>.","ama":"Rösler M, de Jeu M. Asymptotic Analysis for the Dunkl Kernel. <i>Journal of Approximation Theory</i>. 2002;119(1):110-126. doi:<a href=\"https://doi.org/10.1006/jath.2002.3722\">10.1006/jath.2002.3722</a>"},"page":"110-126","intvolume":"       119","_id":"39959","user_id":"93826","department":[{"_id":"555"}],"keyword":["Applied Mathematics","General Mathematics","Numerical Analysis","Analysis"],"extern":"1","language":[{"iso":"eng"}],"type":"journal_article","publication":"Journal of Approximation Theory","status":"public"},{"publication":"Communications in Numerical Methods in Engineering","type":"journal_article","status":"public","department":[{"_id":"9"},{"_id":"154"}],"user_id":"335","_id":"45423","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Computational Theory and Mathematics","General Engineering","Modeling and Simulation","Software"],"issue":"10","publication_identifier":{"issn":["1069-8299","1099-0887"]},"quality_controlled":"1","publication_status":"published","intvolume":"        15","page":"745-754","citation":{"ieee":"R. Mahnken, “Improved implementation of an algorithm for non-linear isotropic/kinematic hardening in elastoplasticity,” <i>Communications in Numerical Methods in Engineering</i>, vol. 15, no. 10, pp. 745–754, 2002, doi: <a href=\"https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r\">10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>.","chicago":"Mahnken, Rolf. “Improved Implementation of an Algorithm for Non-Linear Isotropic/Kinematic Hardening in Elastoplasticity.” <i>Communications in Numerical Methods in Engineering</i> 15, no. 10 (2002): 745–54. <a href=\"https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r\">https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>.","ama":"Mahnken R. Improved implementation of an algorithm for non-linear isotropic/kinematic hardening in elastoplasticity. <i>Communications in Numerical Methods in Engineering</i>. 2002;15(10):745-754. doi:<a href=\"https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r\">10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>","apa":"Mahnken, R. (2002). Improved implementation of an algorithm for non-linear isotropic/kinematic hardening in elastoplasticity. <i>Communications in Numerical Methods in Engineering</i>, <i>15</i>(10), 745–754. <a href=\"https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r\">https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>","mla":"Mahnken, Rolf. “Improved Implementation of an Algorithm for Non-Linear Isotropic/Kinematic Hardening in Elastoplasticity.” <i>Communications in Numerical Methods in Engineering</i>, vol. 15, no. 10, Wiley, 2002, pp. 745–54, doi:<a href=\"https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r\">10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>.","bibtex":"@article{Mahnken_2002, title={Improved implementation of an algorithm for non-linear isotropic/kinematic hardening in elastoplasticity}, volume={15}, DOI={<a href=\"https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r\">10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>}, number={10}, journal={Communications in Numerical Methods in Engineering}, publisher={Wiley}, author={Mahnken, Rolf}, year={2002}, pages={745–754} }","short":"R. Mahnken, Communications in Numerical Methods in Engineering 15 (2002) 745–754."},"year":"2002","volume":15,"author":[{"last_name":"Mahnken","id":"335","full_name":"Mahnken, Rolf","first_name":"Rolf"}],"date_created":"2023-05-31T12:14:42Z","date_updated":"2023-05-31T12:15:12Z","publisher":"Wiley","doi":"10.1002/(sici)1099-0887(199910)15:10<745::aid-cnm288>3.0.co;2-r","title":"Improved implementation of an algorithm for non-linear isotropic/kinematic hardening in elastoplasticity"},{"year":"2002","issue":"5","quality_controlled":"1","title":"Numerical simulation of interface debonding with a combined damage/friction constitutive model","date_created":"2023-05-31T12:04:03Z","publisher":"Springer Science and Business Media LLC","publication":"Computational Mechanics","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Computational Mathematics","Computational Theory and Mathematics","Mechanical Engineering","Ocean Engineering","Computational Mechanics"],"citation":{"ama":"Döbert C, Mahnken R, Stein E. Numerical simulation of interface debonding with a combined damage/friction constitutive model. <i>Computational Mechanics</i>. 2002;25(5):456-467. doi:<a href=\"https://doi.org/10.1007/s004660050493\">10.1007/s004660050493</a>","ieee":"C. Döbert, R. Mahnken, and E. Stein, “Numerical simulation of interface debonding with a combined damage/friction constitutive model,” <i>Computational Mechanics</i>, vol. 25, no. 5, pp. 456–467, 2002, doi: <a href=\"https://doi.org/10.1007/s004660050493\">10.1007/s004660050493</a>.","chicago":"Döbert, C., Rolf Mahnken, and E. Stein. “Numerical Simulation of Interface Debonding with a Combined Damage/Friction Constitutive Model.” <i>Computational Mechanics</i> 25, no. 5 (2002): 456–67. <a href=\"https://doi.org/10.1007/s004660050493\">https://doi.org/10.1007/s004660050493</a>.","short":"C. Döbert, R. Mahnken, E. Stein, Computational Mechanics 25 (2002) 456–467.","bibtex":"@article{Döbert_Mahnken_Stein_2002, title={Numerical simulation of interface debonding with a combined damage/friction constitutive model}, volume={25}, DOI={<a href=\"https://doi.org/10.1007/s004660050493\">10.1007/s004660050493</a>}, number={5}, journal={Computational Mechanics}, publisher={Springer Science and Business Media LLC}, author={Döbert, C. and Mahnken, Rolf and Stein, E.}, year={2002}, pages={456–467} }","mla":"Döbert, C., et al. “Numerical Simulation of Interface Debonding with a Combined Damage/Friction Constitutive Model.” <i>Computational Mechanics</i>, vol. 25, no. 5, Springer Science and Business Media LLC, 2002, pp. 456–67, doi:<a href=\"https://doi.org/10.1007/s004660050493\">10.1007/s004660050493</a>.","apa":"Döbert, C., Mahnken, R., &#38; Stein, E. (2002). Numerical simulation of interface debonding with a combined damage/friction constitutive model. <i>Computational Mechanics</i>, <i>25</i>(5), 456–467. <a href=\"https://doi.org/10.1007/s004660050493\">https://doi.org/10.1007/s004660050493</a>"},"intvolume":"        25","page":"456-467","publication_status":"published","publication_identifier":{"issn":["0178-7675","1432-0924"]},"doi":"10.1007/s004660050493","author":[{"full_name":"Döbert, C.","last_name":"Döbert","first_name":"C."},{"full_name":"Mahnken, Rolf","id":"335","last_name":"Mahnken","first_name":"Rolf"},{"full_name":"Stein, E.","last_name":"Stein","first_name":"E."}],"volume":25,"date_updated":"2023-05-31T12:04:35Z","status":"public","type":"journal_article","user_id":"335","department":[{"_id":"9"},{"_id":"154"}],"_id":"45417"},{"publication_identifier":{"issn":["0264-4401"]},"publication_status":"published","intvolume":"        15","page":"925-955","citation":{"ieee":"R. Mahnken, M. Johansson, and K. Runesson, “Parameter estimation for a viscoplastic damage model using a gradient‐based optimization algorithm,” <i>Engineering Computations</i>, vol. 15, no. 7, pp. 925–955, 2002, doi: <a href=\"https://doi.org/10.1108/02644409810236920\">10.1108/02644409810236920</a>.","chicago":"Mahnken, Rolf, Magnus Johansson, and Kenneth Runesson. “Parameter Estimation for a Viscoplastic Damage Model Using a Gradient‐based Optimization Algorithm.” <i>Engineering Computations</i> 15, no. 7 (2002): 925–55. <a href=\"https://doi.org/10.1108/02644409810236920\">https://doi.org/10.1108/02644409810236920</a>.","ama":"Mahnken R, Johansson M, Runesson K. Parameter estimation for a viscoplastic damage model using a gradient‐based optimization algorithm. <i>Engineering Computations</i>. 2002;15(7):925-955. doi:<a href=\"https://doi.org/10.1108/02644409810236920\">10.1108/02644409810236920</a>","mla":"Mahnken, Rolf, et al. “Parameter Estimation for a Viscoplastic Damage Model Using a Gradient‐based Optimization Algorithm.” <i>Engineering Computations</i>, vol. 15, no. 7, Emerald, 2002, pp. 925–55, doi:<a href=\"https://doi.org/10.1108/02644409810236920\">10.1108/02644409810236920</a>.","short":"R. Mahnken, M. Johansson, K. Runesson, Engineering Computations 15 (2002) 925–955.","bibtex":"@article{Mahnken_Johansson_Runesson_2002, title={Parameter estimation for a viscoplastic damage model using a gradient‐based optimization algorithm}, volume={15}, DOI={<a href=\"https://doi.org/10.1108/02644409810236920\">10.1108/02644409810236920</a>}, number={7}, journal={Engineering Computations}, publisher={Emerald}, author={Mahnken, Rolf and Johansson, Magnus and Runesson, Kenneth}, year={2002}, pages={925–955} }","apa":"Mahnken, R., Johansson, M., &#38; Runesson, K. (2002). Parameter estimation for a viscoplastic damage model using a gradient‐based optimization algorithm. <i>Engineering Computations</i>, <i>15</i>(7), 925–955. <a href=\"https://doi.org/10.1108/02644409810236920\">https://doi.org/10.1108/02644409810236920</a>"},"volume":15,"author":[{"last_name":"Mahnken","id":"335","full_name":"Mahnken, Rolf","first_name":"Rolf"},{"last_name":"Johansson","full_name":"Johansson, Magnus","first_name":"Magnus"},{"last_name":"Runesson","full_name":"Runesson, Kenneth","first_name":"Kenneth"}],"date_updated":"2023-05-31T12:21:15Z","doi":"10.1108/02644409810236920","type":"journal_article","status":"public","department":[{"_id":"9"},{"_id":"154"}],"user_id":"335","_id":"45427","issue":"7","quality_controlled":"1","year":"2002","date_created":"2023-05-31T12:20:54Z","publisher":"Emerald","title":"Parameter estimation for a viscoplastic damage model using a gradient‐based optimization algorithm","publication":"Engineering Computations","abstract":[{"text":"<jats:p>In this work a gradient‐based optimization method is applied in order to determine material parameters for a viscoplastic model with dynamic yield surface coupled to damage as presented in 1997. To this end a sensitivity analysis consistent with the integration scheme presented previously is performed in a systematic manner, both for strain and stress controlled experiments. The algorithm is tested in two numerical examples: first, simulated data are used, in order to re‐obtain parameters for the case of damage under monotonic loading. In the second example material parameters are obtained based on experimental data for lcf‐testing of an austenetic stainless steel, thus showing a very good agreement with respect to hardening, rate and damage effects.</jats:p>","lang":"eng"}],"language":[{"iso":"eng"}],"keyword":["Computational Theory and Mathematics","Computer Science Applications","General Engineering","Software"]},{"language":[{"iso":"eng"}],"keyword":["Applied Mathematics","General Engineering","Numerical Analysis"],"publication":"International Journal for Numerical Methods in Engineering","date_created":"2023-05-31T12:17:46Z","publisher":"Wiley","title":"Efficient integration technique for generalized viscoplasticity coupled to damage","issue":"11","quality_controlled":"1","year":"2002","department":[{"_id":"9"},{"_id":"154"}],"user_id":"335","_id":"45425","type":"journal_article","status":"public","volume":44,"author":[{"first_name":"Magnus","last_name":"Johansson","full_name":"Johansson, Magnus"},{"first_name":"Rolf","id":"335","full_name":"Mahnken, Rolf","last_name":"Mahnken"},{"full_name":"Runesson, Kenneth","last_name":"Runesson","first_name":"Kenneth"}],"date_updated":"2023-05-31T12:18:12Z","doi":"10.1002/(sici)1097-0207(19990420)44:11<1727::aid-nme568>3.0.co;2-p","publication_identifier":{"issn":["0029-5981","1097-0207"]},"publication_status":"published","intvolume":"        44","page":"1727-1747","citation":{"apa":"Johansson, M., Mahnken, R., &#38; Runesson, K. (2002). Efficient integration technique for generalized viscoplasticity coupled to damage. <i>International Journal for Numerical Methods in Engineering</i>, <i>44</i>(11), 1727–1747. <a href=\"https://doi.org/10.1002/(sici)1097-0207(19990420)44:11&#60;1727::aid-nme568&#62;3.0.co;2-p\">https://doi.org/10.1002/(sici)1097-0207(19990420)44:11&#60;1727::aid-nme568&#62;3.0.co;2-p</a>","short":"M. Johansson, R. Mahnken, K. Runesson, International Journal for Numerical Methods in Engineering 44 (2002) 1727–1747.","mla":"Johansson, Magnus, et al. “Efficient Integration Technique for Generalized Viscoplasticity Coupled to Damage.” <i>International Journal for Numerical Methods in Engineering</i>, vol. 44, no. 11, Wiley, 2002, pp. 1727–47, doi:<a href=\"https://doi.org/10.1002/(sici)1097-0207(19990420)44:11&#60;1727::aid-nme568&#62;3.0.co;2-p\">10.1002/(sici)1097-0207(19990420)44:11&#60;1727::aid-nme568&#62;3.0.co;2-p</a>.","bibtex":"@article{Johansson_Mahnken_Runesson_2002, title={Efficient integration technique for generalized viscoplasticity coupled to damage}, volume={44}, DOI={<a href=\"https://doi.org/10.1002/(sici)1097-0207(19990420)44:11&#60;1727::aid-nme568&#62;3.0.co;2-p\">10.1002/(sici)1097-0207(19990420)44:11&#60;1727::aid-nme568&#62;3.0.co;2-p</a>}, number={11}, journal={International Journal for Numerical Methods in Engineering}, publisher={Wiley}, author={Johansson, Magnus and Mahnken, Rolf and Runesson, Kenneth}, year={2002}, pages={1727–1747} }","chicago":"Johansson, Magnus, Rolf Mahnken, and Kenneth Runesson. “Efficient Integration Technique for Generalized Viscoplasticity Coupled to Damage.” <i>International Journal for Numerical Methods in Engineering</i> 44, no. 11 (2002): 1727–47. <a href=\"https://doi.org/10.1002/(sici)1097-0207(19990420)44:11&#60;1727::aid-nme568&#62;3.0.co;2-p\">https://doi.org/10.1002/(sici)1097-0207(19990420)44:11&#60;1727::aid-nme568&#62;3.0.co;2-p</a>.","ieee":"M. Johansson, R. Mahnken, and K. Runesson, “Efficient integration technique for generalized viscoplasticity coupled to damage,” <i>International Journal for Numerical Methods in Engineering</i>, vol. 44, no. 11, pp. 1727–1747, 2002, doi: <a href=\"https://doi.org/10.1002/(sici)1097-0207(19990420)44:11&#60;1727::aid-nme568&#62;3.0.co;2-p\">10.1002/(sici)1097-0207(19990420)44:11&#60;1727::aid-nme568&#62;3.0.co;2-p</a>.","ama":"Johansson M, Mahnken R, Runesson K. Efficient integration technique for generalized viscoplasticity coupled to damage. <i>International Journal for Numerical Methods in Engineering</i>. 2002;44(11):1727-1747. doi:<a href=\"https://doi.org/10.1002/(sici)1097-0207(19990420)44:11&#60;1727::aid-nme568&#62;3.0.co;2-p\">10.1002/(sici)1097-0207(19990420)44:11&#60;1727::aid-nme568&#62;3.0.co;2-p</a>"}},{"volume":9,"author":[{"full_name":"Haeb-Umbach, Reinhold","id":"242","last_name":"Haeb-Umbach","first_name":"Reinhold"}],"date_created":"2019-07-12T05:28:04Z","oa":"1","date_updated":"2022-01-06T06:51:08Z","doi":"10.1109/89.906003","main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/nt/pubs/2001/Ha01.pdf"}],"title":"Automatic generation of phonetic regression class trees for MLLR adaptation","issue":"3","intvolume":"         9","page":"299-302","citation":{"chicago":"Haeb-Umbach, Reinhold. “Automatic Generation of Phonetic Regression Class Trees for MLLR Adaptation.” <i>IEEE Transactions on Speech and Audio Processing</i> 9, no. 3 (2001): 299–302. <a href=\"https://doi.org/10.1109/89.906003\">https://doi.org/10.1109/89.906003</a>.","ieee":"R. Haeb-Umbach, “Automatic generation of phonetic regression class trees for MLLR adaptation,” <i>IEEE Transactions on Speech and Audio Processing</i>, vol. 9, no. 3, pp. 299–302, 2001.","ama":"Haeb-Umbach R. Automatic generation of phonetic regression class trees for MLLR adaptation. <i>IEEE Transactions on Speech and Audio Processing</i>. 2001;9(3):299-302. doi:<a href=\"https://doi.org/10.1109/89.906003\">10.1109/89.906003</a>","apa":"Haeb-Umbach, R. (2001). Automatic generation of phonetic regression class trees for MLLR adaptation. <i>IEEE Transactions on Speech and Audio Processing</i>, <i>9</i>(3), 299–302. <a href=\"https://doi.org/10.1109/89.906003\">https://doi.org/10.1109/89.906003</a>","short":"R. Haeb-Umbach, IEEE Transactions on Speech and Audio Processing 9 (2001) 299–302.","mla":"Haeb-Umbach, Reinhold. “Automatic Generation of Phonetic Regression Class Trees for MLLR Adaptation.” <i>IEEE Transactions on Speech and Audio Processing</i>, vol. 9, no. 3, 2001, pp. 299–302, doi:<a href=\"https://doi.org/10.1109/89.906003\">10.1109/89.906003</a>.","bibtex":"@article{Haeb-Umbach_2001, title={Automatic generation of phonetic regression class trees for MLLR adaptation}, volume={9}, DOI={<a href=\"https://doi.org/10.1109/89.906003\">10.1109/89.906003</a>}, number={3}, journal={IEEE Transactions on Speech and Audio Processing}, author={Haeb-Umbach, Reinhold}, year={2001}, pages={299–302} }"},"year":"2001","department":[{"_id":"54"}],"user_id":"44006","_id":"11778","language":[{"iso":"eng"}],"keyword":["acoustic space","adaptation experiments","automatic generation","bottom-up clustering","broad phonetic class regression trees","correlation criterion","correlation methods","maximum likelihood estimation","maximum likelihood linear regression based speaker adaptation","MLLR adaptation","pattern clustering","phonetic regression class trees","speaker-independent training data","speech recognition","speech units","statistical analysis","trees (mathematics)"],"publication":"IEEE Transactions on Speech and Audio Processing","type":"journal_article","status":"public","abstract":[{"text":"In this paper, it is shown that a correlation criterion is the appropriate criterion for bottom-up clustering to obtain broad phonetic class regression trees for maximum likelihood linear regression (MLLR)-based speaker adaptation. The correlation structure among speech units is estimated on the speaker-independent training data. In adaptation experiments the tree outperformed a regression tree obtained from clustering according to closeness in acoustic space and achieved results comparable with those of a manually designed broad phonetic class tree","lang":"eng"}]},{"status":"public","type":"journal_article","_id":"34897","department":[{"_id":"102"}],"user_id":"93826","intvolume":"         4","page":"182-196","citation":{"apa":"Klüners, J., &#38; Malle, G. (2001). A Database for Field Extensions of the Rationals. <i>LMS Journal of Computation and Mathematics</i>, <i>4</i>, 182–196. <a href=\"https://doi.org/10.1112/s1461157000000851\">https://doi.org/10.1112/s1461157000000851</a>","bibtex":"@article{Klüners_Malle_2001, title={A Database for Field Extensions of the Rationals}, volume={4}, DOI={<a href=\"https://doi.org/10.1112/s1461157000000851\">10.1112/s1461157000000851</a>}, journal={LMS Journal of Computation and Mathematics}, publisher={Wiley}, author={Klüners, Jürgen and Malle, Gunter}, year={2001}, pages={182–196} }","mla":"Klüners, Jürgen, and Gunter Malle. “A Database for Field Extensions of the Rationals.” <i>LMS Journal of Computation and Mathematics</i>, vol. 4, Wiley, 2001, pp. 182–96, doi:<a href=\"https://doi.org/10.1112/s1461157000000851\">10.1112/s1461157000000851</a>.","short":"J. Klüners, G. Malle, LMS Journal of Computation and Mathematics 4 (2001) 182–196.","chicago":"Klüners, Jürgen, and Gunter Malle. “A Database for Field Extensions of the Rationals.” <i>LMS Journal of Computation and Mathematics</i> 4 (2001): 182–96. <a href=\"https://doi.org/10.1112/s1461157000000851\">https://doi.org/10.1112/s1461157000000851</a>.","ieee":"J. Klüners and G. Malle, “A Database for Field Extensions of the Rationals,” <i>LMS Journal of Computation and Mathematics</i>, vol. 4, pp. 182–196, 2001, doi: <a href=\"https://doi.org/10.1112/s1461157000000851\">10.1112/s1461157000000851</a>.","ama":"Klüners J, Malle G. A Database for Field Extensions of the Rationals. <i>LMS Journal of Computation and Mathematics</i>. 2001;4:182-196. doi:<a href=\"https://doi.org/10.1112/s1461157000000851\">10.1112/s1461157000000851</a>"},"publication_identifier":{"issn":["1461-1570"]},"publication_status":"published","doi":"10.1112/s1461157000000851","date_updated":"2023-03-02T09:53:08Z","volume":4,"author":[{"first_name":"Jürgen","last_name":"Klüners","id":"21202","full_name":"Klüners, Jürgen"},{"first_name":"Gunter","full_name":"Malle, Gunter","last_name":"Malle"}],"abstract":[{"text":"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.","lang":"eng"}],"publication":"LMS Journal of Computation and Mathematics","keyword":["Computational Theory and Mathematics","General Mathematics"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["math/0102232"]},"year":"2001","title":"A Database for Field Extensions of the Rationals","publisher":"Wiley","date_created":"2022-12-23T09:56:22Z"},{"date_updated":"2023-03-06T09:58:06Z","author":[{"full_name":"Geissler, Katharina","last_name":"Geissler","first_name":"Katharina"},{"first_name":"Jürgen","last_name":"Klüners","full_name":"Klüners, Jürgen","id":"21202"}],"volume":30,"doi":"10.1006/jsco.2000.0377","publication_status":"published","publication_identifier":{"issn":["0747-7171"]},"citation":{"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>","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.","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} }","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>","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>."},"intvolume":"        30","page":"653-674","_id":"34900","user_id":"93826","department":[{"_id":"102"}],"type":"journal_article","status":"public","publisher":"Elsevier BV","date_created":"2022-12-23T09:58:16Z","title":"Galois Group Computation for Rational Polynomials","issue":"6","year":"2000","keyword":["Computational Mathematics","Algebra and Number Theory"],"language":[{"iso":"eng"}],"publication":"Journal of Symbolic Computation","abstract":[{"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.","lang":"eng"}]},{"issue":"3","year":"2000","publisher":"Elsevier BV","date_created":"2022-12-23T09:58:48Z","title":"Computing Local Artin Maps, and Solvability of Norm Equations","publication":"Journal of Symbolic Computation","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."}],"keyword":["Computational Mathematics","Algebra and Number Theory"],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0747-7171"]},"publication_status":"published","intvolume":"        30","page":"239-252","citation":{"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>","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>.","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} }","short":"V. Acciaro, J. Klüners, Journal of Symbolic Computation 30 (2000) 239–252.","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>.","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>.","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>"},"date_updated":"2023-03-06T09:57:34Z","volume":30,"author":[{"first_name":"Vincenzo","last_name":"Acciaro","full_name":"Acciaro, Vincenzo"},{"first_name":"Jürgen","id":"21202","full_name":"Klüners, Jürgen","last_name":"Klüners"}],"doi":"10.1006/jsco.2000.0361","type":"journal_article","status":"public","_id":"34901","department":[{"_id":"102"}],"user_id":"93826"},{"language":[{"iso":"eng"}],"keyword":["Computational Mathematics","Algebra and Number Theory"],"publication":"Journal of Symbolic Computation","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"}],"date_created":"2022-12-23T09:57:28Z","publisher":"Elsevier BV","title":"Explicit Galois Realization of Transitive Groups of Degree up to 15","issue":"6","year":"2000","user_id":"93826","department":[{"_id":"102"}],"_id":"34899","type":"journal_article","status":"public","author":[{"first_name":"Jürgen","last_name":"Klüners","id":"21202","full_name":"Klüners, Jürgen"},{"last_name":"Malle","full_name":"Malle, Gunter","first_name":"Gunter"}],"volume":30,"date_updated":"2023-03-06T10:48:05Z","doi":"10.1006/jsco.2000.0378","publication_status":"published","publication_identifier":{"issn":["0747-7171"]},"citation":{"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>.","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} }","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."},"page":"675-716","intvolume":"        30"},{"status":"public","type":"journal_article","_id":"34898","department":[{"_id":"102"}],"user_id":"93826","intvolume":"        30","page":"733-737","citation":{"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.","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} }","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>","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>.","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>.","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>"},"publication_identifier":{"issn":["0747-7171"]},"publication_status":"published","doi":"10.1006/jsco.2000.0380","date_updated":"2023-03-06T10:48:40Z","volume":30,"author":[{"first_name":"Jürgen","full_name":"Klüners, Jürgen","id":"21202","last_name":"Klüners"}],"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)."}],"publication":"Journal of Symbolic Computation","keyword":["Computational Mathematics","Algebra and Number Theory"],"language":[{"iso":"eng"}],"year":"2000","issue":"6","title":"A Polynomial with Galois GroupSL2(11)","publisher":"Elsevier BV","date_created":"2022-12-23T09:56:52Z"},{"year":"1999","issue":"3","title":"An uncertainty principle for the Dunkl transform","publisher":"Cambridge University Press (CUP)","date_created":"2023-01-26T08:19:30Z","abstract":[{"text":"<jats:p>This note presents an analogue of the classical Heisenberg-Weyl uncertainty principle for the Dunkl transform on ℝ<jats:sup><jats:italic>N</jats:italic></jats:sup>. Its proof is based on expansions with respect to generalised Hermite functions.</jats:p>","lang":"eng"}],"publication":"Bulletin of the Australian Mathematical Society","keyword":["General Mathematics"],"language":[{"iso":"eng"}],"page":"353-360","intvolume":"        59","citation":{"apa":"Rösler, M. (1999). An uncertainty principle for the Dunkl transform. <i>Bulletin of the Australian Mathematical Society</i>, <i>59</i>(3), 353–360. <a href=\"https://doi.org/10.1017/s0004972700033025\">https://doi.org/10.1017/s0004972700033025</a>","short":"M. Rösler, Bulletin of the Australian Mathematical Society 59 (1999) 353–360.","mla":"Rösler, Margit. “An Uncertainty Principle for the Dunkl Transform.” <i>Bulletin of the Australian Mathematical Society</i>, vol. 59, no. 3, Cambridge University Press (CUP), 1999, pp. 353–60, doi:<a href=\"https://doi.org/10.1017/s0004972700033025\">10.1017/s0004972700033025</a>.","bibtex":"@article{Rösler_1999, title={An uncertainty principle for the Dunkl transform}, volume={59}, DOI={<a href=\"https://doi.org/10.1017/s0004972700033025\">10.1017/s0004972700033025</a>}, number={3}, journal={Bulletin of the Australian Mathematical Society}, publisher={Cambridge University Press (CUP)}, author={Rösler, Margit}, year={1999}, pages={353–360} }","ieee":"M. Rösler, “An uncertainty principle for the Dunkl transform,” <i>Bulletin of the Australian Mathematical Society</i>, vol. 59, no. 3, pp. 353–360, 1999, doi: <a href=\"https://doi.org/10.1017/s0004972700033025\">10.1017/s0004972700033025</a>.","chicago":"Rösler, Margit. “An Uncertainty Principle for the Dunkl Transform.” <i>Bulletin of the Australian Mathematical Society</i> 59, no. 3 (1999): 353–60. <a href=\"https://doi.org/10.1017/s0004972700033025\">https://doi.org/10.1017/s0004972700033025</a>.","ama":"Rösler M. An uncertainty principle for the Dunkl transform. <i>Bulletin of the Australian Mathematical Society</i>. 1999;59(3):353-360. doi:<a href=\"https://doi.org/10.1017/s0004972700033025\">10.1017/s0004972700033025</a>"},"publication_identifier":{"issn":["0004-9727","1755-1633"]},"publication_status":"published","doi":"10.1017/s0004972700033025","date_updated":"2023-01-26T17:40:13Z","volume":59,"author":[{"last_name":"Rösler","full_name":"Rösler, Margit","id":"37390","first_name":"Margit"}],"status":"public","type":"journal_article","extern":"1","_id":"40184","department":[{"_id":"555"}],"user_id":"93826"},{"language":[{"iso":"eng"}],"keyword":["General Mathematics"],"publication":"Duke Mathematical Journal","title":"Positivity of Dunkl’s intertwining operator","date_created":"2023-01-26T08:25:43Z","publisher":"Duke University Press","year":"1999","issue":"3","extern":"1","department":[{"_id":"555"}],"user_id":"93826","_id":"40189","status":"public","type":"journal_article","doi":"10.1215/s0012-7094-99-09813-7","volume":98,"author":[{"id":"37390","full_name":"Rösler, Margit","last_name":"Rösler","first_name":"Margit"}],"date_updated":"2023-01-26T17:40:05Z","page":"445-463","intvolume":"        98","citation":{"mla":"Rösler, Margit. “Positivity of Dunkl’s Intertwining Operator.” <i>Duke Mathematical Journal</i>, vol. 98, no. 3, Duke University Press, 1999, pp. 445–63, doi:<a href=\"https://doi.org/10.1215/s0012-7094-99-09813-7\">10.1215/s0012-7094-99-09813-7</a>.","bibtex":"@article{Rösler_1999, title={Positivity of Dunkl’s intertwining operator}, volume={98}, DOI={<a href=\"https://doi.org/10.1215/s0012-7094-99-09813-7\">10.1215/s0012-7094-99-09813-7</a>}, number={3}, journal={Duke Mathematical Journal}, publisher={Duke University Press}, author={Rösler, Margit}, year={1999}, pages={445–463} }","short":"M. Rösler, Duke Mathematical Journal 98 (1999) 445–463.","apa":"Rösler, M. (1999). Positivity of Dunkl’s intertwining operator. <i>Duke Mathematical Journal</i>, <i>98</i>(3), 445–463. <a href=\"https://doi.org/10.1215/s0012-7094-99-09813-7\">https://doi.org/10.1215/s0012-7094-99-09813-7</a>","ieee":"M. Rösler, “Positivity of Dunkl’s intertwining operator,” <i>Duke Mathematical Journal</i>, vol. 98, no. 3, pp. 445–463, 1999, doi: <a href=\"https://doi.org/10.1215/s0012-7094-99-09813-7\">10.1215/s0012-7094-99-09813-7</a>.","chicago":"Rösler, Margit. “Positivity of Dunkl’s Intertwining Operator.” <i>Duke Mathematical Journal</i> 98, no. 3 (1999): 445–63. <a href=\"https://doi.org/10.1215/s0012-7094-99-09813-7\">https://doi.org/10.1215/s0012-7094-99-09813-7</a>.","ama":"Rösler M. Positivity of Dunkl’s intertwining operator. <i>Duke Mathematical Journal</i>. 1999;98(3):445-463. doi:<a href=\"https://doi.org/10.1215/s0012-7094-99-09813-7\">10.1215/s0012-7094-99-09813-7</a>"},"publication_identifier":{"issn":["0012-7094"]},"publication_status":"published"},{"publication":"Canadian Journal of Mathematics","type":"journal_article","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>If<jats:italic>G</jats:italic>is a closed subgroup of a commutative hypergroup<jats:italic>K</jats:italic>, then the coset space<jats:italic>K</jats:italic>/<jats:italic>G</jats:italic>carries a quotient hypergroup structure. In this paper, we study related convolution structures on<jats:italic>K</jats:italic>/<jats:italic>G</jats:italic>coming fromdeformations of the quotient hypergroup structure by certain functions on<jats:italic>K</jats:italic>which we call partial characters with respect to<jats:italic>G</jats:italic>. They are usually not probability-preserving, but lead to so-called signed hypergroups on<jats:italic>K</jats:italic>/<jats:italic>G</jats:italic>. A first example is provided by the Laguerre convolution on [0, ∞[, which is interpreted as a signed quotient hypergroup convolution derived from the Heisenberg group. Moreover, signed hypergroups associated with the Gelfand pair (<jats:italic>U</jats:italic>(<jats:italic>n</jats:italic>, 1),<jats:italic>U</jats:italic>(<jats:italic>n</jats:italic>)) are discussed.</jats:p>"}],"status":"public","_id":"40192","department":[{"_id":"555"}],"user_id":"37390","keyword":["General Mathematics"],"language":[{"iso":"eng"}],"extern":"1","publication_identifier":{"issn":["0008-414X","1496-4279"]},"publication_status":"published","issue":"1","year":"1999","intvolume":"        51","page":"96-116","citation":{"apa":"Rösler, M., &#38; Voit, M. (1999). Partial Characters and Signed Quotient Hypergroups. <i>Canadian Journal of Mathematics</i>, <i>51</i>(1), 96–116. <a href=\"https://doi.org/10.4153/cjm-1999-006-6\">https://doi.org/10.4153/cjm-1999-006-6</a>","mla":"Rösler, Margit, and Michael Voit. “Partial Characters and Signed Quotient Hypergroups.” <i>Canadian Journal of Mathematics</i>, vol. 51, no. 1, Canadian Mathematical Society, 1999, pp. 96–116, doi:<a href=\"https://doi.org/10.4153/cjm-1999-006-6\">10.4153/cjm-1999-006-6</a>.","bibtex":"@article{Rösler_Voit_1999, title={Partial Characters and Signed Quotient Hypergroups}, volume={51}, DOI={<a href=\"https://doi.org/10.4153/cjm-1999-006-6\">10.4153/cjm-1999-006-6</a>}, number={1}, journal={Canadian Journal of Mathematics}, publisher={Canadian Mathematical Society}, author={Rösler, Margit and Voit, Michael}, year={1999}, pages={96–116} }","short":"M. Rösler, M. Voit, Canadian Journal of Mathematics 51 (1999) 96–116.","ama":"Rösler M, Voit M. Partial Characters and Signed Quotient Hypergroups. <i>Canadian Journal of Mathematics</i>. 1999;51(1):96-116. doi:<a href=\"https://doi.org/10.4153/cjm-1999-006-6\">10.4153/cjm-1999-006-6</a>","ieee":"M. Rösler and M. Voit, “Partial Characters and Signed Quotient Hypergroups,” <i>Canadian Journal of Mathematics</i>, vol. 51, no. 1, pp. 96–116, 1999, doi: <a href=\"https://doi.org/10.4153/cjm-1999-006-6\">10.4153/cjm-1999-006-6</a>.","chicago":"Rösler, Margit, and Michael Voit. “Partial Characters and Signed Quotient Hypergroups.” <i>Canadian Journal of Mathematics</i> 51, no. 1 (1999): 96–116. <a href=\"https://doi.org/10.4153/cjm-1999-006-6\">https://doi.org/10.4153/cjm-1999-006-6</a>."},"date_updated":"2023-01-26T17:51:42Z","publisher":"Canadian Mathematical Society","volume":51,"date_created":"2023-01-26T08:27:14Z","author":[{"last_name":"Rösler","id":"37390","full_name":"Rösler, Margit","first_name":"Margit"},{"last_name":"Voit","full_name":"Voit, Michael","first_name":"Michael"}],"title":"Partial Characters and Signed Quotient Hypergroups","doi":"10.4153/cjm-1999-006-6"},{"user_id":"93826","department":[{"_id":"102"}],"_id":"34902","type":"journal_article","status":"public","author":[{"last_name":"Klüners","id":"21202","full_name":"Klüners, Jürgen","first_name":"Jürgen"}],"volume":27,"date_updated":"2023-03-06T09:21:29Z","doi":"10.1006/jsco.1998.0252","publication_status":"published","publication_identifier":{"issn":["0747-7171"]},"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>","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.","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} }","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>","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>."},"page":"261-269","intvolume":"        27","language":[{"iso":"eng"}],"keyword":["Computational Mathematics","Algebra and Number Theory"],"publication":"Journal of Symbolic Computation","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","publisher":"Elsevier BV","title":"On Polynomial Decompositions","issue":"3","year":"1999"},{"citation":{"apa":"Rösler, M., &#38; Voit, M. (1998). Biorthogonal polynomials associated with reflection groups and a formula of Macdonald. <i>Journal of Computational and Applied Mathematics</i>, <i>99</i>(1–2), 337–351. <a href=\"https://doi.org/10.1016/s0377-0427(98)00168-x\">https://doi.org/10.1016/s0377-0427(98)00168-x</a>","mla":"Rösler, Margit, and Michael Voit. “Biorthogonal Polynomials Associated with Reflection Groups and a Formula of Macdonald.” <i>Journal of Computational and Applied Mathematics</i>, vol. 99, no. 1–2, Elsevier BV, 1998, pp. 337–51, doi:<a href=\"https://doi.org/10.1016/s0377-0427(98)00168-x\">10.1016/s0377-0427(98)00168-x</a>.","bibtex":"@article{Rösler_Voit_1998, title={Biorthogonal polynomials associated with reflection groups and a formula of Macdonald}, volume={99}, DOI={<a href=\"https://doi.org/10.1016/s0377-0427(98)00168-x\">10.1016/s0377-0427(98)00168-x</a>}, number={1–2}, journal={Journal of Computational and Applied Mathematics}, publisher={Elsevier BV}, author={Rösler, Margit and Voit, Michael}, year={1998}, pages={337–351} }","short":"M. Rösler, M. Voit, Journal of Computational and Applied Mathematics 99 (1998) 337–351.","ama":"Rösler M, Voit M. Biorthogonal polynomials associated with reflection groups and a formula of Macdonald. <i>Journal of Computational and Applied Mathematics</i>. 1998;99(1-2):337-351. doi:<a href=\"https://doi.org/10.1016/s0377-0427(98)00168-x\">10.1016/s0377-0427(98)00168-x</a>","chicago":"Rösler, Margit, and Michael Voit. “Biorthogonal Polynomials Associated with Reflection Groups and a Formula of Macdonald.” <i>Journal of Computational and Applied Mathematics</i> 99, no. 1–2 (1998): 337–51. <a href=\"https://doi.org/10.1016/s0377-0427(98)00168-x\">https://doi.org/10.1016/s0377-0427(98)00168-x</a>.","ieee":"M. Rösler and M. Voit, “Biorthogonal polynomials associated with reflection groups and a formula of Macdonald,” <i>Journal of Computational and Applied Mathematics</i>, vol. 99, no. 1–2, pp. 337–351, 1998, doi: <a href=\"https://doi.org/10.1016/s0377-0427(98)00168-x\">10.1016/s0377-0427(98)00168-x</a>."},"intvolume":"        99","page":"337-351","year":"1998","issue":"1-2","publication_status":"published","publication_identifier":{"issn":["0377-0427"]},"doi":"10.1016/s0377-0427(98)00168-x","title":"Biorthogonal polynomials associated with reflection groups and a formula of Macdonald","author":[{"first_name":"Margit","last_name":"Rösler","full_name":"Rösler, Margit","id":"37390"},{"full_name":"Voit, Michael","last_name":"Voit","first_name":"Michael"}],"date_created":"2023-01-26T08:31:16Z","volume":99,"date_updated":"2023-01-26T17:41:01Z","publisher":"Elsevier BV","status":"public","type":"journal_article","publication":"Journal of Computational and Applied Mathematics","extern":"1","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Computational Mathematics"],"user_id":"93826","department":[{"_id":"555"}],"_id":"40197"},{"_id":"40200","department":[{"_id":"555"}],"user_id":"93826","keyword":["Applied Mathematics"],"extern":"1","language":[{"iso":"eng"}],"publication":"Advances in Applied Mathematics","type":"journal_article","status":"public","publisher":"Elsevier BV","date_updated":"2023-01-26T17:40:21Z","volume":21,"author":[{"first_name":"Margit","id":"37390","full_name":"Rösler, Margit","last_name":"Rösler"},{"last_name":"Voit","full_name":"Voit, Michael","first_name":"Michael"}],"date_created":"2023-01-26T08:33:01Z","title":"Markov Processes Related with Dunkl Operators","doi":"10.1006/aama.1998.0609","publication_identifier":{"issn":["0196-8858"]},"publication_status":"published","issue":"4","year":"1998","page":"575-643","intvolume":"        21","citation":{"short":"M. Rösler, M. Voit, Advances in Applied Mathematics 21 (1998) 575–643.","bibtex":"@article{Rösler_Voit_1998, title={Markov Processes Related with Dunkl Operators}, volume={21}, DOI={<a href=\"https://doi.org/10.1006/aama.1998.0609\">10.1006/aama.1998.0609</a>}, number={4}, journal={Advances in Applied Mathematics}, publisher={Elsevier BV}, author={Rösler, Margit and Voit, Michael}, year={1998}, pages={575–643} }","mla":"Rösler, Margit, and Michael Voit. “Markov Processes Related with Dunkl Operators.” <i>Advances in Applied Mathematics</i>, vol. 21, no. 4, Elsevier BV, 1998, pp. 575–643, doi:<a href=\"https://doi.org/10.1006/aama.1998.0609\">10.1006/aama.1998.0609</a>.","apa":"Rösler, M., &#38; Voit, M. (1998). Markov Processes Related with Dunkl Operators. <i>Advances in Applied Mathematics</i>, <i>21</i>(4), 575–643. <a href=\"https://doi.org/10.1006/aama.1998.0609\">https://doi.org/10.1006/aama.1998.0609</a>","chicago":"Rösler, Margit, and Michael Voit. “Markov Processes Related with Dunkl Operators.” <i>Advances in Applied Mathematics</i> 21, no. 4 (1998): 575–643. <a href=\"https://doi.org/10.1006/aama.1998.0609\">https://doi.org/10.1006/aama.1998.0609</a>.","ieee":"M. Rösler and M. Voit, “Markov Processes Related with Dunkl Operators,” <i>Advances in Applied Mathematics</i>, vol. 21, no. 4, pp. 575–643, 1998, doi: <a href=\"https://doi.org/10.1006/aama.1998.0609\">10.1006/aama.1998.0609</a>.","ama":"Rösler M, Voit M. Markov Processes Related with Dunkl Operators. <i>Advances in Applied Mathematics</i>. 1998;21(4):575-643. doi:<a href=\"https://doi.org/10.1006/aama.1998.0609\">10.1006/aama.1998.0609</a>"}},{"status":"public","type":"journal_article","extern":"1","_id":"40205","department":[{"_id":"555"}],"user_id":"93826","intvolume":"       209","page":"624-634","citation":{"apa":"Rösler, M., &#38; Voit, M. (1997). An Uncertainty Principle for Ultraspherical Expansions. <i>Journal of Mathematical Analysis and Applications</i>, <i>209</i>(2), 624–634. <a href=\"https://doi.org/10.1006/jmaa.1997.5386\">https://doi.org/10.1006/jmaa.1997.5386</a>","bibtex":"@article{Rösler_Voit_1997, title={An Uncertainty Principle for Ultraspherical Expansions}, volume={209}, DOI={<a href=\"https://doi.org/10.1006/jmaa.1997.5386\">10.1006/jmaa.1997.5386</a>}, number={2}, journal={Journal of Mathematical Analysis and Applications}, publisher={Elsevier BV}, author={Rösler, Margit and Voit, Michael}, year={1997}, pages={624–634} }","mla":"Rösler, Margit, and Michael Voit. “An Uncertainty Principle for Ultraspherical Expansions.” <i>Journal of Mathematical Analysis and Applications</i>, vol. 209, no. 2, Elsevier BV, 1997, pp. 624–34, doi:<a href=\"https://doi.org/10.1006/jmaa.1997.5386\">10.1006/jmaa.1997.5386</a>.","short":"M. Rösler, M. Voit, Journal of Mathematical Analysis and Applications 209 (1997) 624–634.","ieee":"M. Rösler and M. Voit, “An Uncertainty Principle for Ultraspherical Expansions,” <i>Journal of Mathematical Analysis and Applications</i>, vol. 209, no. 2, pp. 624–634, 1997, doi: <a href=\"https://doi.org/10.1006/jmaa.1997.5386\">10.1006/jmaa.1997.5386</a>.","chicago":"Rösler, Margit, and Michael Voit. “An Uncertainty Principle for Ultraspherical Expansions.” <i>Journal of Mathematical Analysis and Applications</i> 209, no. 2 (1997): 624–34. <a href=\"https://doi.org/10.1006/jmaa.1997.5386\">https://doi.org/10.1006/jmaa.1997.5386</a>.","ama":"Rösler M, Voit M. An Uncertainty Principle for Ultraspherical Expansions. <i>Journal of Mathematical Analysis and Applications</i>. 1997;209(2):624-634. doi:<a href=\"https://doi.org/10.1006/jmaa.1997.5386\">10.1006/jmaa.1997.5386</a>"},"publication_identifier":{"issn":["0022-247X"]},"publication_status":"published","doi":"10.1006/jmaa.1997.5386","date_updated":"2023-01-26T17:40:26Z","volume":209,"author":[{"last_name":"Rösler","full_name":"Rösler, Margit","id":"37390","first_name":"Margit"},{"first_name":"Michael","last_name":"Voit","full_name":"Voit, Michael"}],"publication":"Journal of Mathematical Analysis and Applications","keyword":["Applied Mathematics","Analysis"],"language":[{"iso":"eng"}],"year":"1997","issue":"2","title":"An Uncertainty Principle for Ultraspherical Expansions","publisher":"Elsevier BV","date_created":"2023-01-26T08:38:11Z"},{"ddc":["000"],"keyword":["Computational Mathematics","Algebra and Number Theory"],"language":[{"iso":"eng"}],"publication":"Journal of Symbolic Computation","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"}],"publisher":"Elsevier BV","date_created":"2022-12-23T10:02:24Z","title":"KANT V4","issue":"3-4","year":"1997","_id":"34903","user_id":"93826","department":[{"_id":"102"}],"type":"journal_article","status":"public","date_updated":"2023-03-06T09:23:30Z","author":[{"last_name":"DABERKOW","full_name":"DABERKOW, M.","first_name":"M."},{"first_name":"C.","full_name":"FIEKER, C.","last_name":"FIEKER"},{"first_name":"Jürgen","last_name":"Klüners","full_name":"Klüners, Jürgen","id":"21202"},{"first_name":"M.","full_name":"POHST, M.","last_name":"POHST"},{"full_name":"ROEGNER, K.","last_name":"ROEGNER","first_name":"K."},{"first_name":"M.","full_name":"SCHÖRNIG, M.","last_name":"SCHÖRNIG"},{"last_name":"WILDANGER","full_name":"WILDANGER, K.","first_name":"K."}],"volume":24,"doi":"10.1006/jsco.1996.0126","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0747-7171"]},"citation":{"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.","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} }","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>","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>.","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>"},"intvolume":"        24","page":"267-283"},{"abstract":[{"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.","lang":"eng"}],"publication":"Journal of Symbolic Computation","language":[{"iso":"eng"}],"keyword":["Computational Mathematics","Algebra and Number Theory"],"ddc":["000"],"year":"1997","issue":"3-4","title":"On Computing Subfields","date_created":"2022-12-23T10:03:02Z","publisher":"Elsevier BV","status":"public","type":"journal_article","department":[{"_id":"102"}],"user_id":"93826","_id":"34904","page":"385-397","intvolume":"        24","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>","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>.","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>.","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} }","short":"J. Klüners, M. Pohst, Journal of Symbolic Computation 24 (1997) 385–397.","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>."},"publication_identifier":{"issn":["0747-7171"]},"has_accepted_license":"1","publication_status":"published","doi":"10.1006/jsco.1996.0140","volume":24,"author":[{"first_name":"Jürgen","id":"21202","full_name":"Klüners, Jürgen","last_name":"Klüners"},{"first_name":"Michael","last_name":"Pohst","full_name":"Pohst, Michael"}],"date_updated":"2023-03-06T10:36:21Z"}]