Benjamin Sudakov

Benjamin Sudakov is a Professor of Mathematics at ETH Zurich, where he has held positions since 2013. Previously, he served as a Professor at UCLA (2007-2014) and as an Assistant Professor at Princeton University (2002-2007). He has also been affiliated with the Institute for Advanced Study (2005-2006) and held prestigious fellowships including the Veblen Instructorship (1999-2002). His academic journey began with a Ph.D. from Tel Aviv University in 1999 under the supervision of Noga Alon.

• Education: Ph.D. in Mathematics, Tel Aviv University (1999)
• Advisor: Noga Alon

Sudakov is a leading expert in combinatorics, with primary research interests in probabilistic and extremal combinatorics, random structures, and the application of combinatorial methods to theoretical computer science and mathematics. His work spans algebraic combinatorics, Ramsey theory, and graph theory, addressing foundational questions and developing novel methodologies.

His publications and talks highlight his contributions to Ramsey graphs, equiangular lines, hypergraph theory, and submodular optimization. Key themes include structural graph theory, extremal problems, and probabilistic techniques in discrete mathematics.

• Scientific Awards:
  • Humboldt Research Award (2014)
  • Fellow of the American Mathematical Society (2013)
  • Invited Speaker, ICM 2010
  • David Saxon Presidential Term Chair (2007-2011)
  • NSF CAREER Award (2006-2011)
  • Alfred P. Sloan Fellowship (2004-2006)

Sudakov has mentored 21 Ph.D. students, including prominent mathematicians like Peter Keevash, Jacob Fox, and Matija Bucic, many of whom hold academic positions globally. He has received significant funding, including the SNSF grant 200021_196965, and actively participates in editorial boards and workshops on extremal combinatorics and related fields.

Notable among his collaborative efforts is a series of workshops and seminars at institutions like Banff Research Center, IPAM, DIMACS, and BIRS, focusing on probabilistic and extremal combinatorics. His teaching includes graduate-level courses such as Graph Theory, Probabilistic Methods in Combinatorics, and Algebraic Methods in Combinatorics.