Discrete mathematics is concerned with structures that find diverse application, for example in computer algorithms and modeling of different types of networks (e.g., in street, computer, social, biological networks). Extremal combinatorics is one of the main branches of discrete mathematics and deals with extreme cases: How small (large) can the smallest (largest) network be, to still meet certain characteristics, and what does it look like? Most of these problems are linked to other fields, such as theoretical computer science, information theory, or additive number theory.
Sudakov contributed fundamentally new insights into the field by having solved some long-outstanding issues. His work is characterized by a wide range of methods from other fields, including techniques of algebra and probability theory. At Freie Universität Sudakov will collaborate with Tibor Szabó and Szabó's research group in exploring important open questions in the field of extremal and probabilistic combinatorics.
Sudakov earned his doctorate in mathematics in 1999 from the University of Tel Aviv and continued his training at Princeton University. In 2007 he became a professor of mathematics at the University of California in Los Angeles, and in 2013 he accepted a professorship at ETH Zurich. Sudakov is a Fellow of the American Mathematical Society. He was honored for his work with an Alfred P. Sloan Fellowship and the NSF CAREER Award. In 2010 he was an invited speaker at the International Congress of Mathematicians.
The Alexander von Humboldt Foundation annually awards up to one hundred Humboldt Research Awards in recognition of outstanding achievements in mathematics. As part of the award, the winners are invited to work in a long-term project with colleagues at a German research institute. The nominations are made by scientists in Germany.