Joos Ulrich Heintz | |
|---|---|
 | |
| Born | 27 October 1945 |
| Nationality | Swiss |
| Alma mater | University of Zurich |
| Occupation(s) | Mathematician, Philosopher and Anthropologist |
Joos Ulrich Heintz (born 27 October 1945) is an Argentinean-Swiss mathematician. He is currently a professor emeritus at the University of Buenos Aires. [1]
Heintz 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).
Heintz 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]
Algebraic geometry is a branch of mathematics which uses abstract algebraic techniques, mainly from commutative algebra, to solve geometrical problems. Classically, it studies zeros of multivariate polynomials; the modern approach generalizes this in a few different aspects.
Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, formal language theory, the lambda calculus and type theory.
Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures.
In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values, in order to satisfy a system of constraints on pairs of variables. It is a special case of the general Boolean satisfiability problem, which can involve constraints on more than two variables, and of constraint satisfaction problems, which can allow more than two choices for the value of each variable. But in contrast to those more general problems, which are NP-complete, 2-satisfiability can be solved in polynomial time.
In mathematics, a real closed field is a field F that has the same first-order properties as the field of real numbers. Some examples are the field of real numbers, the field of real algebraic numbers, and the field of hyperreal numbers.
Algorithmic topology, or computational topology, is a subfield of topology with an overlap with areas of computer science, in particular, computational geometry and computational complexity theory.
In computer algebra, the Faugère F4 algorithm, by Jean-Charles Faugère, computes the Gröbner basis of an ideal of a multivariate polynomial ring. The algorithm uses the same mathematical principles as the Buchberger algorithm, but computes many normal forms in one go by forming a generally sparse matrix and using fast linear algebra to do the reductions in parallel.
Information-based complexity (IBC) studies optimal algorithms and computational complexity for the continuous problems that arise in physical science, economics, engineering, and mathematical finance. IBC has studied such continuous problems as path integration, partial differential equations, systems of ordinary differential equations, nonlinear equations, integral equations, fixed points, and very-high-dimensional integration. All these problems involve functions of a real or complex variable. Since one can never obtain a closed-form solution to the problems of interest one has to settle for a numerical solution. Since a function of a real or complex variable cannot be entered into a digital computer, the solution of continuous problems involves partial information. To give a simple illustration, in the numerical approximation of an integral, only samples of the integrand at a finite number of points are available. In the numerical solution of partial differential equations the functions specifying the boundary conditions and the coefficients of the differential operator can only be sampled. Furthermore, this partial information can be expensive to obtain. Finally the information is often contaminated by noise.
Computational mathematics is an area of mathematics devoted to the interaction between mathematics and computer computation.
In mathematics, cylindrical algebraic decomposition (CAD) is a notion, along with an algorithm to compute it, that is fundamental for computer algebra and real algebraic geometry. Given a set S of polynomials in Rn, a cylindrical algebraic decomposition is a decomposition of Rn into connected semialgebraic sets called cells, on which each polynomial has constant sign, either +, − or 0. To be cylindrical, this decomposition must satisfy the following condition: If 1 ≤ k < n and π is the projection from Rn onto Rn−k consisting in removing the last k coordinates, then for every pair of cells c and d, one has either π(c) = π(d) or π(c) ∩ π(d) = ∅. This implies that the images by π of the cells define a cylindrical decomposition of Rn−k.
Planarity is a 2005 puzzle computer game by John Tantalo, based on a concept by Mary Radcliffe at Western Michigan University. The name comes from the concept of planar graphs in graph theory; these are graphs that can be embedded in the Euclidean plane so that no edges intersect. By Fáry's theorem, if a graph is planar, it can be drawn without crossings so that all of its edges are straight line segments. In the planarity game, the player is presented with a circular layout of a planar graph, with all the vertices placed on a single circle and with many crossings. The goal for the player is to eliminate all of the crossings and construct a straight-line embedding of the graph by moving the vertices one by one into better positions.
In mathematical logic, computational complexity theory, and computer science, the existential theory of the reals is the set of all true sentences of the form
In mathematical optimization, the criss-cross algorithm is any of a family of algorithms for linear programming. Variants of the criss-cross algorithm also solve more general problems with linear inequality constraints and nonlinear objective functions; there are criss-cross algorithms for linear-fractional programming problems, quadratic-programming problems, and linear complementarity problems.
Richard M. Pollack was an American geometer who spent most of his career at the Courant Institute of Mathematical Sciences at New York University, where he was Professor Emeritus until his death.
Michael Ira Shub is an American mathematician who has done research into dynamical systems and the complexity of real number algorithms.
Vladimir P. Gerdt was a Russian mathematician and a full professor at the Joint Institute for Nuclear Research (JINR) where he was the head of the Group of Algebraic and Quantum Computations. His research interests were concentrated in computer algebra, symbolic and algebraic computations, algebraic and numerical analysis of nonlinear differential equations, polynomial equations, applications to mathematics and physics, and quantum computation with over 210 published articles.
Ferdinando 'Teo' Mora is an Italian mathematician, and since 1990 until 2019 a professor of algebra at the University of Genoa.
Joris van der Hoeven is a Dutch mathematician and computer scientist, specializing in algebraic analysis and computer algebra. He is the primary developer of GNU TeXmacs.
James Milton Renegar Jr. is an American mathematician, specializing in optimization algorithms for linear programming and nonlinear programming.
Deepak Kapur is a Distinguished Professor in the Department of Computer Science at the University of New Mexico.
