Joos Ulrich Heintz (27 October 1945 - 3 October 2024) was an Argentinean-Swiss mathematician. He was a professor emeritus at the University of Buenos Aires.[1]
Joos Ulrich Heintz | |
|---|---|
 | |
| Born | 27 October 1945 |
| Died | 03 October 2024 Buenos Aires |
| Nationality | Swiss |
| Alma mater | University of Zurich |
| Occupation(s) | Mathematician, Philosopher and Anthropologist |
Biography
editHeintz was born on 27 October 1945 in Zürich, Switzerland. After studying Mathematics and Cultural Anthropology at the University of Zurich to undergraduate level, he went on to receive a PhD in mathematics in 1982 under the supervision of Volker Strassen.[2] He performed his habilitation in 1986 at the J.W.von Goethe University in Frankfurt am Main[3] where he also studied Turcology and Sephardic history and culture. He was appointed Privatdozent at the J.W. Goethe university Frankfurt am Main. Until his retirement in 2017, he worked as a Full Professor at the University of Buenos Aires and University of Cantabria/Spain and as a Senior Researcher at the National Council for Scientific and Technological Development (CONICET).
Research
editHeintz worked mainly in algebraic complexity theory, computational algebraic geometry, and semi algebraic geometry. For this purpose, he developed with his collaborators, different mathematical tools, e.g. the Bezout Inequality[4] or the first effective Nullstellensatz in arbitrary characteristic.[5] This allowed him and his collaborators to adapt Kronecker's elimination theory[6] to the complexity requirements of modern computer algebra and to prove that all reasonable geometric (not algebraic) computation problems are solvable in PSPACE. Later, he extended these complexity results to polynomial input systems given by arithmetic circuits. The outcome was a worst case optimal probabilistic elimination algorithm with the ability to recognize “easily solvable” input systems which was later implemented by Grégoire Lecerf.[7] Finally, Heintz and his collaborators demonstrated that under fragile and natural assumptions, the worst case complexity of elimination algorithms is unavoidably exponential, independent of the chosen data structure.[8] He applied his results and methods also to mixed integer optimization[9] and foundations of software engineering.[10]
Furthermore, in the field of linguistics, he identified the morphology and phonology of the Turkish languages as a regular language.[11]
In 1987, Heintz founded the Argentinean research group Noaï Fitchas in Buenos Aires. This group was transformed into the international working group TERA (Turbo Evaluation and Rapid Algorithms) with collaborators from several Argentinean, French, Spanish and German universities and research institutions, such as the University of Buenos Aires, CONICET, University of Nice, École Polytechnique at Paris, Universidad de Cantabria (Spain), and Humboldt University at Berlin. Noaï Fitchas was used as a pseudonym for the Argentinean group and numerous influential papers in Computer Algebra were published in the nineties under this name.[12][13]
Heintz was a member of the editorial boards of several international journals, including the Foundations of Computational Mathematics, Computational Complexity and Applicable Algebra in Engineering, and Communication and Computing, from which he received three best paper awards.
In 2003, Heintz was awarded the Argentinean Konex Medal of Merit.[14]
Important publications
edit- Heintz, Joos (1983). Definability and fast quantifier elimination in algebraically closed fields. Theoretical Computer Science. 24. pp. 239–277. https://doi.org/10.1016/0304-3975(83)90002-6
- Caniglia L., Galligo A., Heintz J. (1989) Some new effectivity bounds in computational geometry. In: Mora T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1988. Lecture Notes in Computer Science, vol 357. Springer, Berlin, Heidelberg Best Paper Award. https://doi.org/10.1007/3-540-51083-4_54
- Bank B, Giusti M., Heintz J., Mbakop G.M. (1997). Polar varieties, real equation solving, and data structures: the hypersurface case. Journal of Complexity 13 (1). pp. 5–27 https://doi.org/10.1006/jcom.1997.0432 1997 Journal of Complexity Best Paper Award
- Giusti M., Heintz J., Morais J.E., Morgenstern J., Pardo L.M. (1998). Straight-line programs in geometric elimination theory. Journal of Pure and Applied Algebra 124 (1-3) (1998) 101-146 https://doi.org/10.1016/S0022-4049(96)00099-0
- Heintz J., Kuijpers B., Rojas Paredes A. (2013). Software Engineering and complexity in effective Algebraic Geometry. Journal of Complexity 29 (1). pp. 92–138 https://doi.org/10.1016/j.jco.2012.04.005 2013 Journal of Complexity Best Paper Award
- Bank B., Giusti M., Heintz J., Lecerf G., Matera G., Solernó G. (2015). Degeneracy Loci and Polynomial Equation Solving. Foundations of Computational Mathematics, 15 (1). pp. 159–184 https://doi.org/10.1007/s10208-014-9214-z
References
edit- ^ "Resolution University of Buenos Aires EXP-UBA 36.186/2014" (PDF).
- ^ "Joos Ulrich Heintz at the Mathematics Genealogy Project".
- ^ "W. Schwarz, J. Wolfart. Zur Geschichte des Mathematischen Seminars der Universität Frankfurt am Main von 1914 bis 1970 (2002)" (PDF).
- ^ Heintz, Joos (1983). "Definability and fast quantifier elimination in algebraically closed fields". Theoretical Computer Science. 24 (3): 239–277. doi:10.1016/0304-3975(83)90002-6.
- ^ Caniglia, L.; Heintz, J.; Galligo, A. (1988). "Borne simple exponentielle pour les degrés dans le théorème des zéros sur un corps de caractéristique quelconque". Comptes rendus de l'Académie des Sciences. 307: 255–258.
- ^ Kronecker, Leopold (1882). "Grundzüge einer algebraischen Theorie der arithmetischen Grössen". Journal für die reine und angewandte Mathematik. 92: 1–122.
- ^ Giusti, M.; Lecerf, G.; Salvy, B. (2001). "A Gröbner free alternative for polynomial system solving". Journal of Complexity. 17: 154–211. doi:10.1006/jcom.2000.0571.
- ^ Bank, B.; Heintz, Joos; Matera, G.; Montaña, J.L.; Pardo, L.M.; Rojas Paredes, A. (2016). "Quiz games as a model for information hiding". Journal of Complexity. 34: 1–29. arXiv:1508.07842. doi:10.1016/j.jco.2015.11.005. S2CID 31037127.
- ^ Bank, B.; Heintz, J.; Krick, T.; Mandel, R.; Solernó, P. (1993). "Une borne optimale pour la programmation entière quasi-convexe". Bulletin de la Société Mathématique de France. 121 (2): 299–314. doi:10.24033/bsmf.2210.
- ^ Heintz, J.; Kuijpers, B.; Rojas Paredes, A. (2013). "Software Engineering and complexity in effective Algebraic Geometry". Journal of Complexity. 29: 92–138. arXiv:1110.3030. doi:10.1016/j.jco.2012.04.005.
- ^ Heintz, Joos; Schönig, Claus (1991). "Turkic morphology as regular language". Central Asiatic Journal. 35 (1–2): 96–122. JSTOR 41927774.
- ^ Berenstein, C.A.; Struppa, D.C. (1991). "Recent improvements in the complexity of the effective Nullstellensatz". Linear Algebra and Its Applications. 157: 203–215. doi:10.1016/0024-3795(91)90115-D.
- ^ Heintz, Joos (2021). "La complejidad es el momento de la verdad" (PDF). Ciencia e Investigacion. Reseñas. 9 (2). Asociación Argentina para el Progreso de las Ciencias: 43–55.
- ^ "Premio Konex 2003: Ingeniería Electrónica, Comunicación e Informática".