László Lovász speaking in 2007 at the EPFL
March 9, 1948
|Alma mater||Eötvös Loránd University, Budapest|
Hungarian Academy of Sciences
|Awards|| Kyoto Prize (2010) |
Hungary's Széchenyi Grand Prize (2008)
Bolyai Prize (2007)
John von Neumann Theory Prize (2006)
Gödel Prize (2001)
Knuth Prize (1999)
Wolf Prize (1999)
Fulkerson Prize (1982, 2012)
Best Information Theory Paper Award (IEEE) (1980)
Pólya Prize (SIAM) (1979)
|Fields||Mathematics, Computer Science|
|Institutions||Eötvös Loránd University, Yale University, Princeton University|
|Doctoral advisor||Tibor Gallai|
|Doctoral students|| András Frank |
László Lovász (Hungarian pronunciation: [ˈlaːsloː ˈlovaːs] ; born March 9, 1948) is a Hungarian 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. He is the current president of the Hungarian Academy of Sciences. He served as president of the International Mathematical Union between January 1, 2007 and December 31, 2010.
Lovász was born on March 9, 1948 in the city of Budapest.His father was a surgeon. When Lovász was 14 he found a mathematical article written by Paul Erdős that fascinated him. One year later, he personally became acquainted with Erdős. They became friends and talked about mathematics and other subjects. This experience greatly inspired Lovász in searching for more knowledge.
In high school, Lovász won gold medals at the International Mathematical Olympiad (in 1964, 1965, 1966 with two special prizes).
Lovász received his Candidate of Sciences (C.Sc.) degree in 1970 at the Hungarian Academy of Sciences. His advisor was Tibor Gallai.
Until 1975, Lovász worked at Eötvös Loránd 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. 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).
In 2014 he was elected the President of the Hungarian Academy of Sciences (MTA).
Lovász is married to Katalin Vesztergombi;as high school students, he and Vesztergombi both participated in the same program for students gifted in mathematics, and Vesztergombi continues to be one of Lovász's frequent research collaborators.
Lovász was awarded the Brouwer Medal in 1993, 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 Netherlands Academy of Arts and Sciences (2006)and Royal Swedish Academy of Sciences (2007), honorary member 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. Lovász is listed as an ISI highly cited researcher.
|Wikimedia Commons has media related to László Lovász .|
| President of the Hungarian Academy of Sciences |
Endre Szemerédi is a Hungarian-American mathematician and computer scientist, working in the field of combinatorics and theoretical computer science. He has been the State of New Jersey Professor of computer science at Rutgers University since 1986. He also holds a professor emeritus status at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.
Eötvös Loránd University is a Hungarian public research university based in Budapest. Founded in 1635, ELTE is one of the largest and most prestigious public higher education institutions in Hungary. The 28,000 students at ELTE are organized into eight faculties, and into research institutes located throughout Budapest and on the scenic banks of the Danube. ELTE is affiliated with 5 Nobel laureates, as well as winners of the Wolf Prize, Fulkerson Prize and Abel Prize, the latest of which was Abel Prize winner Endre Szemerédi in 2012.
Péter Frankl is a mathematician, street performer, columnist and educator, active in Japan. Frankl studied Mathematics at Eötvös Loránd University in Budapest and submitted his PhD thesis while still an undergraduate. He holds PhD degree from University Paris Diderot as well. He has lived in Japan since 1988, where he is a well-known personality and often appears in the media. He keeps travelling around Japan performing. Frankl won a gold medal at the International Mathematical Olympiad in 1971. He has seven joint papers with Paul Erdős, and eleven joint papers with Ronald Graham. His research is in combinatorics, especially in extremal combinatorics. He is the author of the union-closed sets conjecture.
László Rátz,, was a Hungarian mathematics high school teacher best known for educating such people as John von Neumann and Nobel laureate Eugene Wigner. He was a legendary teacher of "Budapest-Fasori Evangélikus Gimnázium", the Budapest Lutheran Gymnasium, a famous secondary school in Budapest in Hungary.
The Budapest Semesters in Mathematics program is a study abroad opportunity for North American undergraduate students in Budapest, Hungary. The coursework is primarily mathematical and conducted in English by Hungarian professors whose primary positions are at Eötvös Loránd University or the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences. Originally started by László Lovász, László Babai, Vera Sós, and Pál Erdős, the first semester was conducted in Spring 1985. The North- American part of the program is currently run by Tina Garrett out of St. Olaf College in Northfield, MN. She is supported by Kendra Killpatrick and Eileen Shimota. The former North American Directors were Paul D. Humke (1988–2011) and Tom Trotter. The Hungarian director is Dezső Miklós.
Gyula Y. Katona is a Hungarian mathematician, the son of mathematician Gyula O. H. Katona. He received his Ph.D. in 1997 from Hungarian Academy of Sciences, with a dissertation entitled Paths and Cycles in Graphs and Hypergraphs under the advisement of László Lovász and András Recski, and as of 2009 is on the faculty of the Budapest University of Technology and Economics.
András Hajnal was a professor of mathematics at Rutgers University and a member of the Hungarian Academy of Sciences known for his work in set theory and combinatorics.
Gábor Tardos is a Hungarian mathematician, currently a professor at Central European University and previously a Canada Research Chair at Simon Fraser University. He works mainly in combinatorics and computer science. He is the younger brother of Éva Tardos.
Lajos Pósa is a Hungarian mathematician working in the topic of combinatorics, and one of the most prominent mathematics educators of Hungary, best known for his mathematics camps for gifted students. He is a winner of the Széchenyi Prize. Paul Erdős's favorite "child", he discovered theorems at the age of 16. Since 2002, he has worked at the Rényi Institute of the Hungarian Academy of Sciences; earlier he was at the Eötvös Loránd University, at the Departments of Mathematical Analysis, Computer Science.
Imre Bárány is a Hungarian mathematician, working in combinatorics and discrete geometry. He works at the Rényi Mathematical Institute of the Hungarian Academy of Sciences, and has a part-time job at University College London.
András Frank is a Hungarian mathematician, working in combinatorics, especially in graph theory, and combinatorial optimisation. He is director of the Institute of Mathematics of the Eötvös Loránd University, Budapest.
Zsolt Baranyai was a Hungarian mathematician, working in combinatorics.
Vera T. Sós is a Hungarian mathematician, specializing in number theory and combinatorics. She was a student and close collaborator of both Paul Erdős and Alfréd Rényi. She also collaborated frequently with her husband Pál Turán, the analyst, number theorist, and combinatorist. Until 1987, she worked at the Department of Analysis at the Eötvös Loránd University, Budapest. Since then, she has been employed by the Alfréd Rényi Institute of Mathematics. She was elected a corresponding member (1985), member (1990) of the Hungarian Academy of Sciences. In 1997, Sós was awarded the Széchenyi Prize.
György Elekes was a Hungarian mathematician and computer scientist who specialized in Combinatorial geometry and Combinatorial set theory. He may be best known for his work in the field that would eventually be called Additive Combinatorics. Particularly notable was his "ingenious" application of the Szemerédi–Trotter theorem to improve the best known lower bound for the sum-product problem. He also proved that any polynomial-time algorithm approximating the volume of convex bodies must have a multiplicative error, and the error grows exponentially on the dimension. With Micha Sharir he set up a framework which eventually led Guth and Katz to the solution of the Erdős distinct distances problem.
Gábor Halász is a Hungarian mathematician. He specialised in number theory and mathematical analysis, especially in analytic number theory. He is a member of the Hungarian Academy of Sciences. Since 1985, he is professor at the Eötvös Loránd University, Budapest.
Károly Bezdek is a Hungarian-Canadian mathematician. He is a professor as well as a Canada Research Chair of mathematics and the director of the Centre for Computational and Discrete Geometry at the University of Calgary in Calgary, Alberta, Canada. Also he is a professor of mathematics at the University of Pannonia in Veszprém, Hungary. His main research interests are in geometry in particular, in combinatorial, computational, convex, and discrete geometry. He has authored 3 books and more than 120 research papers. He is a founding Editor-in-Chief of the e-journal Contributions to Discrete Mathematics (CDM).
Miklós Simonovits is a Hungarian mathematician who currently works at the Rényi Institute of Mathematics in Budapest and is a member of the Hungarian Academy of Sciences. He is on the advisory board of the journal Combinatorica. He is best known for his work in extremal graph theory and was awarded Széchenyi Prize in 2014. Among other things, he discovered the method of progressive induction which he used to describe graphs which do not contain a predetermined graph and the number of edges is close to maximal. With Lovász, he gave a randomized algorithm using O(n7 log2n) separation calls to approximate the volume of a convex body within a fixed relative error.
Balázs Szegedy is a Hungarian mathematician whose research concerns combinatorics and graph theory.
Katalin L. Vesztergombi is a Hungarian mathematician known for her contributions to graph theory and discrete geometry. A student of Vera T. Sós and a co-author of Paul Erdős, she is an emeritus associate professor at Eötvös Loránd University and a member of the Hungarian Academy of Sciences.