| László Lovász | |
| Birth Date: | 9 March 1948 |
| Birth Place: | Budapest, Hungary |
| Citizenship: | Hungarian, American |
| Nationality: | Hungarian |
| Fields: | Mathematics, Computer Science |
| Workplaces: | Eötvös Loránd UniversityMicrosoft Research CenterYale UniversityUniversity of Szeged |
| Alma Mater: | Eötvös Loránd University Hungarian Academy of Sciences |
| Doctoral Advisor: | Tibor Gallai |
| Thesis Title: | Factors of Graphs |
| Thesis Year: | 1971 |
| Doctoral Students: | András Frank Tamás Szőnyi Van Vu |
| Known For: | Erdős–Faber–Lovász conjectureKneser's conjectureLenstra–Lenstra–Lovász lattice basis reduction algorithmLovász local lemma |
| Awards: | Abel Prize (2021) Kyoto Prize in Basic Sciences (2010) Széchenyi Prize (2008) (2007) John von Neumann Theory Prize (2006) Gödel Prize (2001) Knuth Prize (1999) Wolf Prize (1999) Fulkerson Prize (1982, 2012) Pólya Prize (SIAM) (1979) |
László Lovász (in Hungarian ˈlovaːs ˈlaːsloː /; born March 9, 1948) is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He was the president of the International Mathematical Union from 2007 to 2010 and the president of the Hungarian Academy of Sciences from 2014 to 2020.
In graph theory, Lovász's notable contributions include the proofs of Kneser's conjecture and the Lovász local lemma, as well as the formulation of the Erdős–Faber–Lovász conjecture. He is also one of the eponymous authors of the LLL lattice reduction algorithm.
Lovász was born on March 9, 1948, in Budapest, Hungary.
Lovász attended the Fazekas Mihály Gimnázium in Budapest.[1] He won three gold medals (1964–1966) and one silver medal (1963) at the International Mathematical Olympiad.[1] He also participated in a Hungarian game show about math prodigies. Paul Erdős helped introduce Lovász to graph theory at a young age.
Lovász received his Candidate of Sciences (C.Sc.) degree in 1970 at the Hungarian Academy of Sciences. His advisor was Tibor Gallai.[2] He received his first doctorate (Dr.Rer.Nat.) degree from Eötvös Loránd University in 1971 and his second doctorate (Dr.Math.Sci.) from the Hungarian Academy of Sciences in 1977.
From 1971 to 1975, Lovász worked at Eötvös Loránd University as a research associate. From 1975 to 1978, he was a docent at the University of Szeged, and then served as a professor and the Chair of Geometry there until 1982. He then returned to Eötvös Loránd University as a professor and the Chair of Computer Science until 1993.
Lovász was a professor at Yale University from 1993 to 1999, when he moved to the Microsoft Research Center where he worked as a senior researcher until 2006. He returned to Eötvös Loránd University where he was the director of the Mathematical Institute (2006–2011)[3] and a professor in the Department of Computer Science (2006–2018).[4] He retired in 2018.[4]
Lovász was the president of the International Mathematical Union between January 1, 2007, and December 31, 2010.[5] In 2014, he was elected the president of the Hungarian Academy of Sciences (MTA) and served until 2020.[6] [7]
In collaboration with Erdős in the 1970s, Lovász developed complementary methods to Erdős's existing probabilistic graph theory techniques. This included the Lovász local lemma, which has become a standard technique for proving the existence of rare graphs. Also in graph theory, Lovász proved Kneser's conjecture and helped formulate the Erdős–Faber–Lovász conjecture.
With Arjen Lenstra and Hendrik Lenstra in 1982, Lovász developed the LLL algorithm for approximating points in lattices and reducing their bases.[8] The LLL algorithm has been described by Gil Kalai as "one of the fundamental algorithms" and has been used in several practical applications, including polynomial factorization algorithms and cryptography.
Donald Knuth named Lovász as one of his combinatorial heroes in a 2023 interview.[9]
Lovász was awarded the Pólya Prize in 1979, the Fulkerson Prize in 1982 and 2012, the Brouwer Medal in 1993, the Wolf Prize and Knuth Prize in 1999, the Gödel Prize in 2001, the John von Neumann Theory Prize in 2006, the in 2007, the Széchenyi Prize in 2008, and the Kyoto Prize in Basic Sciences in 2010.[4] [10] [11] In March 2021, he shared the Abel Prize with Avi Wigderson from the Institute for Advanced Study "for their foundational contributions to theoretical computer science and discrete mathematics, and their leading role in shaping them into central fields of modern mathematics".[12] [13] [14] In 2017 he received John von Neumann Professor title from the Budapest University of Technology and Economics (BME) and the John von Neumann Computer Society.[15] In 2021, he received Hungary's highest order, the Hungarian Order of Saint Stephen.[16]
He was elected a foreign member of the Royal Netherlands Academy of Arts and Sciences in 2006[17] and the Royal Swedish Academy of Sciences in 2007, and an honorary member of the London Mathematical Society in 2009.[18] Lovász was elected as a member of the U.S. National Academy of Sciences in 2012.[19] In 2012 he became a fellow of the American Mathematical Society.[20]
Lovász is married to fellow mathematician Katalin Vesztergombi, with whom he participated in a program for high school students gifted in mathematics, and has four children.[4] He is a dual citizen of Hungary and the United States.[4]