László Lovász
László Lovász ( born March 9, 1948 in Budapest) is a Hungarian mathematician who is best known for his work in the field of combinatorics and graph theory.
Life and work
László Lovász 1971 received his doctorate Tibor Gallai at the Eötvös Loránd University ( ELTE ) in Budapest. From 1971 to 1975, he was then a research associate at ELTE, 1975-1978 Lecturer at the József Attila University in Szeged. Subsequently, he was until 1982 held the chair of geometry. Then he returned to Budapest, where he became the chair of computer science at ELTE, which he held from 1983 to 1993. László Lovász in 1993 went to the U.S., where he was a professor at Yale University and from 1999 to 2006 worked from 1993 to 2000 Microsoft Research. In 2006 he returned to Budapest and became director of the Mathematical Institute of the ELTE. He also held visiting professorships at Vanderbilt University (1972 /72), the University of Waterloo (1978 /79), the University of Bonn (1984 /85), the University of Chicago (1985 ) and Cornell University (1985) and is Honorary Professor at the Research Institute for Discrete Mathematics, University of Bonn. From 2007 to 2010 he was president of the International Mathematical Union ( IMU) and is represented as an ex officio on the Board from 2011 to 2014.
With the (g, f) - factor set László Lovász delivered in 1970 an important generalization of the f - factor theorem of Tutte. In 1972 he proved then the so-called weak perfect graph conjecture for which has since been referred to as perfect -graph set or as a set of Lovász. In 1975 he proved named after him Lovász - Local - Lemma.
He is with Arjen Lenstra and Hendrik Lenstra inventor of the LLL algorithm to reduce the basis of grids with applications for example in cryptography.
Awards and honors
For his work in the field of discrete mathematics Lovász awarded the 1999 Wolf Prize and the Knuth Prize. In 2006 he received the John von Neumann Theory Prize. In 1990 he gave a plenary lecture at the ICM in Kyoto (Geometric Algorithms and Algorithmic Geometry ) and 1983, he was invited speaker at the ICM in Warsaw ( Algorithmic aspects of combinatorics, geometry and number theory ). In 1993 he received the Brouwer Medal. In 2008 he gave a plenary lecture at the European Congress of Mathematicians in Amsterdam ( Very large graphs ). In 2010 he was awarded the Kyoto Prize, 2012 with the Fulkerson Prize. He is a Fellow of the American Mathematical Society.
Works
- Ronald L. Graham, Martin Grotschel, Laszlo Lovasz (all editors ): Handbook of Combinatorics - Vol.1 & 2 MIT Press 1996
- L. Lovász, J. Pelikan, K. Vesztergombi: Discrete Mathematics: Elementary and Beyond. Springer 2003.