EntityQ357918· pop 37· linked from 477 articles

László Lovász

Hungarian mathematician

Listeners · Last.fm

Listeners: 1
Total plays: 12

via Last.fm · László Lovász

Key facts

Born: ( 1948-03-09 ) March 9, 1948 (age 78) , Budapest , Hungary
Citizenship: Hungarian, American
Education: Eötvös Loránd University ( CSc , PhD ), Hungarian Academy of Sciences ( PhD )
Known for: Erdős–Faber–Lovász conjecture , Kneser's conjecture , Lenstra–Lenstra–Lovász lattice basis reduction algorithm , Lovász local lemma
Awards: Abel Prize (2021) , Kyoto Prize in Basic Sciences (2010), Széchenyi Prize (2008), János Bolyai Creative Prize [ hu ] (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)
Fields: Mathematics, Computer Science
Institutions: Eötvös Loránd University , Microsoft Research Center , Yale University , University of Szeged
Thesis: Factors of Graphs (1971)
Doctoral advisor: Tibor Gallai
Doctoral students: András Frank , Tamás Szőnyi , Van Vu

via Wikipedia infobox

Article

László Lovász ( 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.