© 2001-2018 Московский физико-технический институт
Master's program in discrete mathematics - 2017
In September 2015, a new master's program has successfully started at the Moscow Institute of Physics and Technology (MIPT). Now we are looking for fresh motivated students who wish to apply for the same program in October 2017!
The program is focused on modern aspects of combinatorics (or, a bit more generally, discrete mathematics) and its applications in computer science and in the theory of complex networks. Below we provide a list of courses, but first of all we would like to emphasize the features and competitive advantages of our master's program.
Advantages of Master’s program “Advanced Combinatorics”
- The program is 2 years long. All courses are taught in English.
- The program is completely free for 5 strongest applicants selected by the program committee. Moreover, a stipend of 5000 Russian Rubles will be paid monthly in this case. Additional scholarship will be available.
- The program welcomes any additional number of students selected by the committee. The annual tuition fee is as low as 4000€.
- Moscow Institute of Physics and Technology (MIPT) provides every student with accommodation in modern buildings on campus. The monthly apartment rental fee is only 1250 Russian Rubles, which is about 18€.
- MIPT helps with obtaining a Russian visa and getting a health insurance.
- Besides courses by strong lectors from MIPT (including professors V.L. Dol'nikov, A.Ya. Kanel-Belov, R.N. Karasev, A.M. Raigorodskii, D.A. Shabanov, I.D. Shkredov, et al.), we also have leaders in the field from the renowned scientific institutions as visiting lecturers. Among them are D. Gamarnik (MIT, Boston), G.O.H. Katona (Renyi Institute, Budapest), J. Pach (EPFL, Lausanne; Renyi Institute, Budapest), B. Sudakov (ETH Zurich), P. Tetali (Georgia Tech, Atlanta), N. Litvak (Twente). This is a really unique combination!
- We have strong partnership with many renowned combinatorial research centers all around the world. Among them are: MIT Boston, Renyi Institute Budapest, EPFL Lausanne, Tel-Aviv University, ETH Zurich, INRIA France, Cambridge University UK, UCL UK, Technische and Freie Universities Berlin, Georgia Tech Atlanta, and many others. Thus, we can help our students who successfully finish our master’s program not only to become PhD students at MIPT, but also to apply for graduate studies at the above-listed partner institutions.
- The department of Discrete Mathematics at MIPT, which is organizing this master's program, not only employs prominent professors listed above, but also has well established partnership with Yandex, the most popular search engine in Russia. Professor Andrei M. Raigorodskii, head of the department and director of the program, is also the leader of a research division at Yandex that aims at applying combinatorial methods to provide good models for web-graphs and to improve search quality. Thus, our students have an opportunity add an internship at Yandex research labs to their portfolio.
- Although our program covers the state-of-the-art advanced modern combinatorics and applications, we shall certainly spend some time in the first semester to introduce our students to the basics of the subject.
The program stars with a bunch of courses that we call “re-indroductional”. These are needed to equate students’ basic knowledge in algebra, probability and basic discrete mathematics. We’ll rely on that basic tools during the next three semesters to build a solid picture of modern combinatorics, with a slight emphasis on graph (and network) theory and geometry. Every semester we’ll also have at least one course by an invited lecturer. Here is the list of courses:
- Discrete Structures
- Theory of probability
- Linear algebra
- Extremal Combinatorics (a course by Miklos Simonovits)
- Introduction to Discrete Geometry I
- Introduction to Discrete Geometry II
- Random Graphs I
- Advanced Graph Theory
- Extremal problems on posets and beyond (a course by G.O.H. Katona)
- Modern Discrete Geometry (a course by J. Pach)
- Random Graphs II
- Game Theory
- Complex Networks (a course by N. Litvak)
- New approaches to hard problems of extremal combinatorics (a course by B. Sudakov)
- Additive Combinatorics
The fourth semester is solely devoted to research and master’s thesis preparation.