Balázs Szegedy

from Wikipedia, the free encyclopedia

Balázs Szegedy is a Hungarian mathematician . He deals with combinatorics and graph theory .

Life

Szegedy studied mathematics at the Eötvös Loránd University with a diploma in 1998 and a doctorate in 2003 with Péter Pálfy (On the Sylow and Borel subgroups of classical groups). As a post-doctoral student he was at the Alfred Renyi Institute of the Hungarian Academy of Sciences, from 2003 to 2005 at Microsoft Research , at the Institute for Advanced Study in Princeton (2005/2006) and from 2006 he was Assistant Professor and from 2011 Associate Professor at the University of Toronto on the Scarborough (Toronto) campus . From 2013 he was at the Alfred Renyi Institute.

He developed a theory of higher order structures in compact Abelian groups, which he called higher order Fourier analysis . With Lovasz he developed a theory of limits on sequences of dense graphs (graph limits, described by real functions in two variables, which they called graphons). The area also has links to ergodic theory.

Szegedy won the Kato Renyi Prize in 1997 and the Géza Grünwald Prize of the Hungarian Mathematical Society in 2002. In 2009 he received the European Prize in Combinatorics . In 2010 he was a Sloan Fellow . In 2013 he won the Coxeter James Prize and in 2012 with László Lovász the Fulkerson Prize (for their work Limits of dense graph sequences , Journal of Combinatorial Theory, Series B, vol. 96, pp. 933–957, 2006). In 2008 he was invited speaker at the European Congress of Mathematicians in Amsterdam .

Web links

Individual evidence

  1. ↑ Balázs Szegedy in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. ^ Szegedy On higher order Fourier analysis , 2012
  3. ↑ Lovasz, Szegedy, Limits of dense graph sequences, 2004
personal data
SURNAME Szegedy, Balázs
BRIEF DESCRIPTION Hungarian mathematician
DATE OF BIRTH 20th century