ADVANCED  COMBINATORICS


The programme is focused on modern aspects of combinatorics (discrete mathematics) and its applications in computer science and in the theory of complex networks.

KEY ADVANTAGES:
  • We admit students with solid knowledge of basic math (algebra, analysis, probability, discrete mathematics), who wish to study advanced combinatorial techniques and applications.
  • We teach advanced state-of-the-art methods used in discrete mathematics and foster intuition of working with discrete objects and models.
  • We employ leading MIPT professors and invite visiting professors from renowned research groups in the field of combinatorial mathematics.
  • We provide our students with an opportunity to do research in various topics of discrete mathematics – both pure and applied.

TEACHING METHODS:
Only in the first semester, we have four elective courses re-introducing our students into calculus, algebra, combinatorics, and probability. In all the semesters, we have:
  • 3-4 main courses with weekly lectures and seminars;
  • 1-2 intensive courses by prominent visiting professors including Benjamin Sudakov, David Gamarnik, Janos Pach, Gyula O.H. Katona, Prasad Tetali;
  • Research meetings with scientific advisors (office hours);
  • Interdepartmental seminar on Discrete Mathematics (every week);
  • Seminar on Discrete Mathematics and its Applications in Network Analysis (every week at Yandex, the top Russian internet search engine).

STUDIED COURSES:
“Introductory” courses with emphasis on combinatorial viewpoint:
Specialized topics:
  • Combinatorics;
  • Random graphs;
  • Graph Theory;
  • Advanced graph theory;
  • Probability;
  • Combinatorial  geometry;
  • Calculus and algebra;
  • Additive combinatorics;
Common methods:Courses with applied flavour:
  • Discrete Analysis;
  • Game theory;
  • Extremal combinatorics;
  • Discrete Optimization;

  • Computational  complexity;
  • Complex networks.

PROGRAMME PARTNERS:
  • Steklov Mathematics Institute (Russia);
  • Yandex (Russia);
  • Alfréd Rényi Institute of Mathematics (Hungary);
  • École Polytechnique Fédérale de Lausanne (Swiss).
Programme Coordinator
Prof. Andrei Raigorodskii
mraigor@yandex.ru

KEY ADVANTAGES: We admit students with solid knowledge of basic math (algebra, analysis, probability, discrete mathematics), who wish to study advanced combinatorial techniques and applications.We teach advanced state-of-the-art methods used in discrete mathematics and foster intuition of working with discrete objects and models.We employ leading MIPT professors and invite visiting professors from renowned research groups in the field of combinatorial mathematics.We provide our students with an opportunity to do research in various topics of discrete mathematics – both pure and applied.Перевести
PROGRAMME PARTNERS: — выберите перевод:
[---]
.
Смотрите также: