Benny Sudakov (Hebrew: בני סודקוב; born October 1969)[1] is an Israeli mathematician, who works mainly on extremal and probabilistic combinatorics.
Biography
He was born in Tbilissi, Georgia,[1] and completed his undergraduate studies at Tbilisi State University in 1990.[2] After emigrating to Israel, he received his PhD from Tel Aviv University in 1999, under the supervision of Noga Alon.[3] From 1999 until 2002, he held a Veblen Research Instructorship,[4] a joint position between Princeton University and the Institute for Advanced Study. Until 2007, he was an assistant professor at Princeton University. Until 2014, he was a professor at the University of California, Los Angeles.[2] In July 2013, Sudakov joined ETH Zurich as a professor.[5]
Sudakov has broad interests within the field of combinatorics, having written papers on extremal combinatorics, Ramsey theory, random graphs, and positional games.[2]
In 2012, he became a Fellow of the American Mathematical Society.[6]
He gave an invited talk at the International Congress of Mathematicians in 2010 at Hyderabad, on the topic of "Combinatorics".[7]
References
- ^ a b "Biographies of Candidates 2012" (PDF), Notices of the American Mathematical Society, 59 (8): 1140, 2012
- ^ a b c "Benny Sudakov's CV" (PDF).
- ^ Benny Sudakov at the Mathematics Genealogy Project
- ^ "IAS scholar information site". 9 December 2019.
- ^ Department of Mathematics (September 27, 2012). "ETH Zurich appoints Benjamin Sudakov". www.math.ethz.ch. Retrieved February 6, 2013.
- ^ List of Fellows of the American Mathematical Society, retrieved 2013-08-05.
- ^ "ICM Plenary and Invited Speakers since 1897". International Congress of Mathematicians. Archived from the original on 2017-11-08. Retrieved 2013-08-15.
