Mathias Schacht

from Wikipedia, the free encyclopedia

Mathias Schacht (* 1977 ) is a German mathematician who deals with combinatorics . He is a professor at the University of Hamburg . He deals with graph theory , Ramsey theory and extremal combinatorics, random discrete structures and probabilistic methods and theoretical computer science.

Life

From 1997, Schacht studied mathematics, computer science and business informatics at the TU Berlin and Emory University in Atlanta, where he completed his master’s degree in 2002 ( A Turan theorem for random graphs ) and received his doctorate in 2004 from Vojtěch Rödl ( On the regularity method for hypergraphs ). He has been researching at the Humboldt University of Berlin since 2004 , where he completed his habilitation in 2009 ( Regular partitions of hypergraphs and property testing ). He has been a Heisenberg Professor in the research group for discrete mathematics at the University of Hamburg since 2010.

In collaboration with Rödl and others, he further developed Endre Szemerédi’s regularity lemma in a version for hypergraphs . Timothy Gowers did the same independently .

In 2006 he received the Richard Rado Prize for his dissertation and in 2012 the George Pólya Prize with Rödl.

Fonts

  • with B. Nagle, Y. Kohayakawa, V. Rödl, J. Skokan The hypergraph regularity method and its applications , Proc. Nat. Acad. Sci., Vol. 102, 2005, pp. 8109-8113
  • with Nagle, Rödl Extremal hypergraph problems and the regularity method , Discrete Mathematics, Volume 26, 2006, pp. 247-278
  • with Nagle, Rödl The Counting Lemma for regular k-uniform hypergraphs , Random Structures & Algorithms, Volume 28, 2006, pp. 113–179
  • Regular partitions of hypergraphs and property testing. [Electronic resource] Berlin: Humboldt University of Berlin, Faculty of Mathematics and Natural Sciences II 2010 (Habil.) ( Digitized ; PDF; 1.4 MB)

Web links

Individual evidence

  1. ^ Mathematics Genealogy Project
  2. Rado price for manhole