Joris van der Hoeven | |
|---|---|
 From left: Xiao-Shan Gao, Joris van der Hoeven 2006 | |
| Born | 1971 (age 51–52) |
| Alma mater | Paris Diderot University |
| Awards |
|
| Scientific career | |
| Fields | Computer science, Mathematics |
| Institutions | École Polytechnique |
| Thesis | Asymptotique automatique (1997) |
| Doctoral advisor | Jean-Marc Steyaert |
Joris van der Hoeven (born 1971) is a Dutch mathematician and computer scientist, specializing in algebraic analysis and computer algebra. He is the primary developer of GNU TeXmacs.
Joris van der Hoeven received in 1997 his doctorate from Paris Diderot University (Paris 7) with thesis Asymptotique automatique. [1] He is a Directeur de recherche at the CNRS and head of the team Max Modélisation algébrique at the Laboratoire d'informatique of the École Polytechnique. [2]
His research deals with transseries (i.e. generalizations of formal power series) with applications to algebraic analysis and asymptotic solutions of nonlinear differential equations. In addition to transseries' properties as part of differential algebra and model theory, he also examines their algorithmic aspects as well as those of classical complex function theory.
He is the main developer of GNU TeXmacs (a free scientific editing platform) [3] and Mathemagix (free software, a computer algebra and analysis system). [4]
In 2019, van der Hoeven and his coauthor David Harvey announced their discovery of the fastest known multiplication algorithm, allowing the multiplication of -bit binary numbers in time . [5] Their paper was peer reviewed and published in the Annals of Mathematics in 2021.
In 2018, he was an Invited Speaker (with Matthias Aschenbrenner and Lou van den Dries) with the talk On numbers, germs, and transseries at the International Congress of Mathematicians in Rio de Janeiro. [6] [7] In 2018, the three received the Karp Prize. [8]
{{cite book}}: CS1 maint: location missing publisher (link)In mathematics, the factorial of a non-negative integer , denoted by , is the product of all positive integers less than or equal to . The factorial of also equals the product of with the next smaller factorial:
Multiplication is one of the four elementary mathematical operations of arithmetic, with the other ones being addition, subtraction, and division. The result of a multiplication operation is called a product.
Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor. It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best known classical algorithms. On the other hand, factoring numbers of practical significance requires far more qubits than available in the near future. Another concern is that noise in quantum circuits may undermine results, requiring additional qubits for quantum error correction.
A multiplication algorithm is an algorithm to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient than others. Efficient multiplication algorithms have existed since the advent of the decimal system.
GNU TeXmacs is a scientific word processor and typesetting component of the GNU Project. It originated as a variant of GNU Emacs with TeX functionalities, though it shares no code with those programs, while using TeX fonts. It is written and maintained by Joris van der Hoeven and a group of developers. The program produces structured documents with a WYSIWYG user interface. New document styles can be created by the user. The editor provides high-quality typesetting algorithms and TeX and other fonts for publishing professional looking documents.
The binary GCD algorithm, also known as Stein's algorithm or the binary Euclidean algorithm, is an algorithm that computes the greatest common divisor of two nonnegative integers. Stein's algorithm uses simpler arithmetic operations than the conventional Euclidean algorithm; it replaces division with arithmetic shifts, comparisons, and subtraction.
A residue numeral system (RNS) is a numeral system representing integers by their values modulo several pairwise coprime integers called the moduli. This representation is allowed by the Chinese remainder theorem, which asserts that, if M is the product of the moduli, there is, in an interval of length M, exactly one integer having any given set of modular values. The arithmetic of a residue numeral system is also called multi-modular arithmetic.
In mathematics, the Bernstein–Sato polynomial is a polynomial related to differential operators, introduced independently by Joseph Bernstein (1971) and Mikio Sato and Takuro Shintani, Sato (1990). It is also known as the b-function, the b-polynomial, and the Bernstein polynomial, though it is not related to the Bernstein polynomials used in approximation theory. It has applications to singularity theory, monodromy theory, and quantum field theory.
In calculus, symbolic integration is the problem of finding a formula for the antiderivative, or indefinite integral, of a given function f(x), i.e. to find a differentiable function F(x) such that
In mathematics, the Kummer–Vandiver conjecture, or Vandiver conjecture, states that a prime p does not divide the class number hK of the maximal real subfield of the p-th cyclotomic field. The conjecture was first made by Ernst Kummer on 28 December 1849 and 24 April 1853 in letters to Leopold Kronecker, reprinted in, and independently rediscovered around 1920 by Philipp Furtwängler and Harry Vandiver,
John K. S. McKay was a British-Canadian mathematician and academic who worked at Concordia University, known for his discovery of monstrous moonshine, his joint construction of some sporadic simple groups, for the McKay conjecture in representation theory, and for the McKay correspondence relating certain finite groups to Lie groups.
The following tables list the computational complexity of various algorithms for common mathematical operations.
In theoretical computer science, the computational complexity of matrix multiplication dictates how quickly the operation of matrix multiplication can be performed. Matrix multiplication algorithms are a central subroutine in theoretical and numerical algorithms for numerical linear algebra and optimization, so finding the right amount of time it should take is of major practical relevance.
Matthias Aschenbrenner is a German-American mathematician. He is a professor of mathematics at the University of Vienna and director of the logic group there. His research interests include differential algebra and model theory.
FGLM is one of the main algorithms in computer algebra, named after its designers, Faugère, Gianni, Lazard and Mora. They introduced their algorithm in 1993. The input of the algorithm is a Gröbner basis of a zero-dimensional ideal in the ring of polynomials over a field with respect to a monomial order and a second monomial order. As its output, it returns a Gröbner basis of the ideal with respect to the second ordering. The algorithm is a fundamental tool in computer algebra and has been implemented in most of the computer algebra systems. The complexity of FGLM is O(nD3), where n is the number of variables of the polynomials and D is the degree of the ideal. There are several generalization and various applications for FGLM.
Wang Dongming is Research Director at the French National Center for Scientific Research. He was awarded Wen-tsün Wu Chair Professor at the University of Science and Technology of China in 2001, Changjiang Scholar of the Chinese Ministry of Education in 2005, and Bagui Scholar of Guangxi Zhuang Autonomous Region, China in 2014. He was elected Member of the Academia Europaea in 2017.
Laurentius Petrus Dignus "Lou" van den Dries is a Dutch mathematician working in model theory. He is a professor emeritus of mathematics at the University of Illinois at Urbana–Champaign.
In mathematics, the field of logarithmic-exponential transseries is a non-Archimedean ordered differential field which extends comparability of asymptotic growth rates of elementary nontrigonometric functions to a much broader class of objects. Each log-exp transseries represents a formal asymptotic behavior, and it can be manipulated formally, and when it converges, corresponds to actual behavior. Transseries can also be convenient for representing functions. Through their inclusion of exponentiation and logarithms, transseries are a strong generalization of the power series at infinity and other similar asymptotic expansions.
Mark Giesbrecht is a Canadian computer scientist who is the 12th dean of the University of Waterloo’s Faculty of Mathematics, starting from July 1, 2020. He was the Director of the David R. Cheriton School of Computer Science at the University of Waterloo, Canada from July 2014 until June 2020.
In mathematics, a sparse polynomial is a polynomial that has far fewer terms than its degree and number of variables would suggest. For example, x10 + 3x3 - 1 is a sparse polynomial as it is a trinomial with a degree of 10.
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
