Mathematician Endre Szemerédi receives doctorate honoris causa












            ******************************************************************************************

            *
            ******************************************************************************************
            On June 15, 2010, professor Endre Szemerédi received doctorate honoris causa of Physical a

            Sciences. Based on a decision of the science committee, the doctorate was presented by Cha
            promotor, professor Jaroslav Nešetřil.
            “Professor Szemerédi was one of the first to realize the importance of theoretical compute

            became renowned in the field. As always, he has focused on key areas: sorting, complexity 
            operations and expanders,” said professor Nešetřil.


            “Czech students are on a remarkable level thanks to top quality mathematical education,” s
            Szemerédi, a long-standing director of the REU International exchange programme, under whi

            the Faculty of Mathematics and Physics study at top US universities. Szemerédi maintains c
            the Charles University Faculty of Mathematics and Physics and his annual lectures have a p
            on the work of the faculty's scholars and students. In this respect,   Szemerédi follows t

            his teacher Paul Erdös, also a doctor honoris causa of Charles University.
            “Most of the time, I make errors in mathematics, especially when working on something new.
            start from scratch and rarely get to the right result,” admitted professor Szemerédi, a re

            domestic and international awards, including American Mathematical Society's Leroy P. Stee
            the Swedish Royal Academy's Rolf Schock Award.
            Professor Szemerédi is the author of many famous results in mathematics and theoretical co

            Some of them are fundamental in their nature and can even be explained in layman's terms. 
            rare in abstract fields like these and proves the universality and profoundness of his wor
            Szemerédi theorem, for instance, states that each dense set of integers contains an arithm

            of arbitrary length. His proof not only solved the old and well-known Erdös-Turán problem,
            of the cornerstones of number theory and contemporary mathematics as such.
            Another example is the Szemerédi's regularity lemma, which states that every large enough 

            divided into subsets of about the same size so that the edges between different subsets be
            randomly. His work in theoretical computer science includes optimal sorting algorithms, on
            problems of data processing. He also worked in the fields of geometry and probability. In 

            Szeremédi's works bear the stamp of absolute quality and universality, and are of fundamen
            Translation: Jaroslav Švelch