László Lovász
László Lovász | |
|---|---|
 László Lovász speaking in 2007 at the EPFL | |
| Born | March 9, 1948 |
| Nationality | Hungarian-American |
| Alma mater | Eötvös Loránd University, Budapest Hungarian Academy of Sciences |
| Known for | President of the International Mathematical Union |
| Awards | Kyoto Prize (2010) Hungary's Széchenyi Grand Prize (2008) Bolyai prize (2007) Gödel Prize (2001) Wolf Prize (1999) Fulkerson Prize (1982, 2012) Best Information Theory Paper Award (IEEE) (1981) Pólya Prize (SIAM) (1979) |
| Scientific career | |
| Fields | Mathematics, Computer Science |
| Institutions | Eötvös Loránd University, Yale University, Princeton University |
| Doctoral advisor | Tibor Gallai |
| Doctoral students | András Frank Tamás Szőnyi Van Vu |
László Lovász (Hungarian: [ˈlaːsloː ˈlovaːs], born March 9, 1948) is a Hungarian–American mathematician, best known for his work in combinatorics, for which he was awarded the Wolf Prize and the Knuth Prize in 1999, and the Kyoto Prize in 2010.
Biography
In high school, Lovász won gold medals at the International Mathematical Olympiad (in years 1964, 1965, 1966 with two special prizes) and so did his son in 2008.[1]
Lovász received his Candidate of Sciences degree in 1970 at Hungarian Academy of Sciences. His advisor was Tibor Gallai.
Until 1975, Lovász worked at the Eötvös University, between 1975–1982, he led the Department of Geometry at the University of Szeged. In 1982, he returned to the Eötvös University, where he created the Department of Computer Science. The former and current scientists of the department include György Elekes, András Frank, József Beck, Éva Tardos, András Hajnal, Lajos Pósa, Miklós Simonovits, Tamás Szőnyi.
Lovász was a professor at Yale University during the 1990s and was a collaborative member of the Microsoft Research Center until 2006. He returned to Eötvös Loránd University, Budapest, where he was the director of the Mathematical Institute (2006–2011).
He served as president of the International Mathematical Union between January 1, 2007 and December 31, 2010.[2]
Lovász wrote 6 papers with Paul Erdős, a mathematician who was famous for writing papers with co-authors, which earned Lovász an Erdős number of one.
Awards
Lovász was awarded the Wolf Prize in 1999, the Bolyai prize in 2007 and Hungary's Széchenyi Grand Prize (2008). He received the Advanced Grant of the European Research Council (2008). He was elected foreign member of the Royal Swedish Academy of Sciences (2007), honorary member[3] of the London Mathematical Society (2009). He received the Kyoto Prize for Basic Science (2010). In 2012 he became a fellow of the American Mathematical Society.[4] Lovász is listed as an ISI highly cited researcher.[5]
Books
He co-authored or edited the following books:
- Lovász L., Pelikán J., Vesztergombi K.: Kombinatorika, Tankönyvkiadó, Budapest, 1977
- Gács P., Lovász L.: Algoritmusok, Müszaki Könyvkiadó, Budapest, 1978; Tankönyvkiadó, Budapest, 1987
- L. Lovász: Combinatorial Problems and Exercises, Akadémiai Kiadó - North Holland, Budapest, 1979, revised: Elsevier, Akadémiai Kiadó, 1993, reprint: AMS Chelsea Publishing, 2007.
- L. Lovász, M.D. Plummer: Matching Theory, Akadémiai Kiadó - North Holland, Budapest, 1986
- L. Lovász: An Algorithmic Theory of Numbers, Graphs, and Convexity, CBMS-NSF Regional Conference Series in Applied Mathematics 50, SIAM, Philadelphia, Pennsylvania, 1986
- M. Grötschel, L. Lovász, A. Schrijver: Geometric Algorithms and Combinatorial Optimization, Springer, 1988
- B. Korte, L. Lovász, R. Schrader: Greedoids, Springer, 1991
- Ronald L. Graham, M. Grötschel, L. Lovász (eds.): Handbook of Combinatorics Elsevier Science B.V., 1995
- L. Lovász, J. Pelikán, K. Vesztergombi K.: Discrete Mathematics: Elementary and Beyond, Springer, New York, 2003
- L. Lovász: Large Networks and Graph Limits, American Mathematical Society, 2012
See also
- Topological combinatorics
- Lovász conjecture
- Erdős–Faber–Lovász conjecture
- Lovász local lemma
- Lenstra-Lenstra-Lovász lattice reduction algorithm
- Geometry of numbers
- Perfect graph theorem
- Greedoid
- Bell number
- Lovász number
- Graph limit
Notes
- ^ Laszlo Miklos Lovasz
- ^ The IMU Executive Committee 2007-2010
- ^ LMS homepage
- ^ List of Fellows of the American Mathematical Society, retrieved 2013-02-02.
- ^ Thomson ISI, Lovász, László, ISI Highly Cited Researchers, retrieved 2010-02-02
External links
- Lovász's Homepage
- László Lovász at the Mathematics Genealogy Project
- László Lovász's results at International Mathematical Olympiad
| International | |
|---|---|
| National | |
| Academics | |
| People | |
| Other | |
- 1948 births
- Living people
- Hungarian mathematicians
- Hungarian computer scientists
- 20th-century mathematicians
- 21st-century mathematicians
- Members of the Hungarian Academy of Sciences
- Members of the Royal Swedish Academy of Sciences
- Foreign Members of the Russian Academy of Sciences
- Fellows of the American Mathematical Society
- Combinatorialists
- Graph theorists
- Yale University faculty
- Gödel Prize laureates
- Knuth Prize laureates
- Wolf Prize in Mathematics laureates
- ISI highly cited researchers
- International Mathematical Olympiad participants