Raigorodskii Andrew M.

Doctor of Physical and Mathematical Sciences, Professor MIPT and MSU

Head of the Department of Discrete Mathematics FIOT, supervisor of undergraduate department "Data Analysis", the head of department of theoretical and applied research Yandex, editor in chief of Moscow Journal of Combinatorics and Number Theory, the author of over 100 scientific articles, winner of the Prize of the President of the Russian Federation in 2011 for young scientists.


Andrew Raigorodskii born June 18, 1976 in Moscow. From 1983 to 1993 he studied at the Moscow school ? 18 (1275) with in-depth study of French. He graduated from high school with honors. In 1993 he joined the Department of Mathematics and Mechanics and Mathematics Faculty of Moscow State University. MV Lomonosov. In 1998, after graduating with honors from the University, he entered the graduate department of number theory Mekhmat led by NG Moshchevitina, from which he graduated in 2001. In the spring of 2001 he defended his thesis on "Combinatorial and geometric properties of sets of points." Since 2001, began working at the department of mathematical statistics and stochastic processes as a lecturer. In summer 2004 he defended his doctoral thesis on "The problems of Borsuk, Nelson-Erd?s-Hadwiger and Grünbaum in combinatorial geometry" specialty "Discrete mathematics and mathematical cybernetics." In 2005 he became an assistant professor Mekhmat in 2011 - professor. Since 2007, an employee of OOO "Yandex", created by the laboratory combinatorial and probabilistic methods, currently - Head of theoretical and applied research. Since 2007 - Professor, Department of innovations and high technologies of the Moscow Physical-Technical Institute, since 2011 - Head of the Department of Discrete Mathematics. Lectured at the Independent University of Moscow, at the School of the data analysis Yandex. Has lectured at universities abroad. Mathematics teacher at school number 179 of the Moscow Institute of Open Education.

Research interests

Raigorodskii basically refers to various issues in combinatorics and combinatorial topology. In particular, it Borsuk problem on partitioning sets into parts of smaller diameter problem Nelson - Hadwiger colorability metric space problem Erdos - Hajnal on hypergraph coloring. Raigorodskii also deals with practical applications of the theory of graphs and hypergraphs (work in the company "Yandex"), in particular, the construction of models and research random web graphs. Andrew M. - active popularizer of science, author of several popular science books and brochures.


In 2005 he won first prize at the Presidium of RAS cycle of combinatorial geometry. In February 2012, received the Award of the President of the Russian Federation in 2011 in the field of Science and Innovation for Young Scientists "major achievements in several parts of discrete mathematics and its applications in information technology."

17 May 2014



MATHS 01:03:58
9th lecture from course:
MATHS 01:02:05
5th lecture from course:
MATHS 01:14:04
11th lecture from course:
MATHS 01:09:33
1st lecture from course:
MATHS 01:05:28
2nd lecture from course:
MATHS 00:58:41
4th lecture from course:
MATHS 01:02:05
5th lecture from course:
MATHS 01:20:56
6th lecture from course:
MATHS 01:19:42
7th lecture from course:
MATHS 01:12:05
8th lecture from course:
Download our mobile app
Google Play