Benny Sudakov

from Wikipedia, the free encyclopedia
From left: Jeff Kahn , Benjamin Sudakov, Angelika Steger , Oberwolfach

Benjamin "Benny" Sudakov ( Hebrew בני סודקוב; * October 1969 in Tblissi ) is an Israeli mathematician .

Life

Sudakov studied mathematics at Tbilisi State University with an intermediate diploma degree in 1990 and at Tel Aviv University with a master's degree summa cum laude in 1993. He received his doctorate in Tel Aviv in 1999 with Noga Alon (dissertation: Extremal problems in probabilistic combinatorics and their algorithmic aspects ). In 2002 he became an assistant professor at Princeton University , and he was a member of the Institute for Advanced Study at Princeton (2003 and 2005 to 2006). In 2007 he became a professor at the University of California, Los Angeles , and has been a professor at ETH Zurich since 2013 .

He deals with extremal combinatorics, algebraic and probabilistic methods in combinatorics , graph theory , Ramsey theory , random structures in combinatorics and applications of combinatorics in computer science .

In 2010 he was invited speaker at the International Congress of Mathematicians in Hyderabad (India) ( Recent developments in extremal combinatorics: Ramsey and Turán-type problems ). In 2014 he received the Humboldt Research Award , in 2013 he became a Fellow of the American Mathematical Society and in 2019 a member of the Academia Europaea . From 2004 to 2006 he was a Sloan Research Fellow .

His graduate students include Jacob Fox , with whom (and David Conlon) he also published improved bounds on Ramsey numbers of hypergraphs.

Fonts (selection)

  • with Endre Szemerédi , Van H. Vu : On a question of Erdős and Moser , Duke Math J. 129 (2005), 129–155.
  • with Noga Alon, Asaf Shapira: Additive approximation for edge-deletion problems , Annals of Mathematics, 170 (2009), 371-411.
  • with David Conlon , Jacob Fox : Hypergraph Ramsey numbers , J. AMS 23 (2010), 247-266.
  • with David Conlon, Jacob Fox: An approximate version of Sidorenko's conjecture , Geom. Funct. Anal., 20: 1354-1366 (2010).
  • A conjecture of Erdös on graph Ramsey numbers , Adv. Math. 227 (2011), 601-609.
  • with David Conlon, Jacob Fox: Two extensions of Ramsey's theorem , Duke Math. J. 162 (2013), 2903-2927.

Web links

References and comments

  1. Biography of Candidates, Notices AMS, September 2012, p. 1140
  2. referred to as a Bachelor's degree in his English CV