Loading...

Contemporary combinatorics

Online Master’s program in English

Phystech School of Applied Mathematics and Informatics

Remote Open Day 2020

Program Overview

The Phystech School of Applied Mathematics and Informatics of the Moscow Institute of Physics and Technology (MIPT) launches a call for the two-year Online Master’s Program «Contemporary combinatorics» ( in English). The Program will create a solid foundation of knowledge of modern discrete mathematics and its applications in computer science and in the analysis of complex networks.

This program is focused on the modern aspects of combinatorics (discrete mathematics) and its applications in computer science and in the theory of complex networks. Students both study advanced state-of-the-art methods used in discrete mathematics and foster intuition of working with discrete objects and models and do research in various topics of discrete mathematics – either pure or applied.


We invite you

János Pach is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry. Pach received his Candidate degree from the Hungarian Academy of Sciences, in 1983, where his advisor was Miklós Simonovits. Since 1977, he has been affiliated with the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences. He was Research Professor at the Courant Institute of Mathematical Sciences at NYU (since 1986), Distinguished Professor of Computer Science at City College, CUNY (1992-2011), and Neilson Professor at Smith College (2008-2009). In 2008, he joined École Polytechnique Fédérale de Lausanne as Professor of Mathematics.

Watch video invitation from János Pach

Gyula O.H. Katona is a Hungarian mathematician known for his work in combinatorial set theory, and especially for the Kruskal–Katona theorem and his beautiful and elegant proof of the Erdős–Ko–Rado theorem in which he discovered a new method, now called Katona's cycle method. Since then, this method has become a powerful tool in proving many interesting results in extremal set theory. He is affiliated with the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.

Watch video invitation from Gyula O.H. Katona

"MIPT is one of the strongest universities in Europe. Especially in Graph Theory, Combinatorics and their Applications.

This is why I did not hesitate a minute when I was asked in 2015 to join the new Master’s program. I accepted this offer with great pleasure. Since then I give each year a series of lectures on my favorite area: Extremal Set Theory. So, you do not know what it is? I give an example.

There are n people, members of a society. For different tasks they form committees. The democratic rule is that no committee can be a proper subset of another one. At most how many committees can be formed? If you chose this program, I will tell the answer in the first class. Extremal Set Theory has many other similar, but not so easy problems. But Combinatorics has many other, nice, interesting subfields. You can learn all of those from my excellent colleagues.

What is nice about Combinatorics? On the one hand it asks questions that can be explained to a highschool student between two bus-stops, though to answer the question might be very difficult, needing surprising ideas. On the other hand Combinatorics is in "one step" from real life problems, it is really an applicable mathematics, I always enjoyed teaching these classes, since the audience consisted of smart, motivated young people from all around the world. And I had the impression that they liked that I taught them. In one case it was sure. A Chinese lady, after receiving her Master’s degree at MIPT, came to Budapest to continue her studies and she is now writing her PhD thesis under my supervision.

One more thing. From MIPT, within 30 minutes you can reach the center of an exciting, vibrant city: MOSCOW."

Nelly Litvak is professor in Algorithms for Complex Networks and has a background in Applied Probability and Stochastic Operations Research. She works on mathematical methods and algorithms for complex networks, such as social networks and the WWW. Real-life networks are modeled as random graphs, and algorithms are used to extract information from the massive network data.

The overall goal of her research is to extract value from (Big) Data, focusing on network data. Her research revolves around three main topics: Information extraction and predictions based on data, mathematical analysis of network characteristics and randomized algorithms. The first looks at defining and collecting the correct measurements and data for specific purposes and deducing networks from data. The second examines mathematical properties of algorithms in networks, for example, the famous PageRank that Google invented to rank web pages. The third looks at efficient algorithms for computing network characteristics when the complete network data is not available.

Watch video invitation from Nelly V. Litvak

Features of the implementation of the Master’s program

With the help of new educational technologies and the “flipped learning” approach, courses on basic specialties, compulsory general education courses and interaction with a research supervisor on writing research are being transferred to the online form.

The educational program consists of:

  • 1. electronic courses in which the student will be able to vary the pace of study;
  • 2. weekly webinars in the format of “office hours”, in which you can interact interactively with the teacher and ask the questions;
  • 3. personal advice on the conduct of scientific work.

Intermediate exams are taken using remote identity verification technologies with a remote proctor controller.

Career benefits for the graduates


Top 5 skills

The students who enter the program are expected to develop/strengthen the following skills:

  • — The ability to read original research papers on various topics of combinatorial mathematics.
  • — The ability to carry out a supervised research in the area of choice in combinatorics.
  • — The ability to design mathematical models for a real world problems.
  • — The ability to present the results of the research to professional community.
  • — The ability to carry out computational experiments backed by theoretical considerations.

Career tracks

  • — Researcher (mathematics, applied mathematics, computer science).
  • — Software developer / algorithm designer.
  • — Analyst.

Spheres for future employment

  • — Research institutions in mathematics in computer science.
  • — Information technology companies, incl. the Program Partners.

Professors

How to apply

To apply for our program, please, fill-in the application form or write a letter to our email address interadmission@phystech.edu until mid-September. To your letter, you should attach your documents. The complete list of documents for applying:

Copy of passport which will be used to enter Russian Federation. The passport should be valid for at least 18 month after the presumed date of starting the education program.

Documents of your previous education (bachelor/specialist/master diploma) with the list of subjects studies and grades for them. If you haven’t received it yet – you can attach a certificate that you are still studying and will receive a diploma this year.

Your CV including places where you have studied before or worked before.

Letters of recommendation (at least two) are needed. Recommendation letters should be send by your referees directly to our email address interadmission@phystech.edu.

Applicants should have a basic knowledge of:

Algebra: groups, rings, fields, finite fields, matrices, polynomials.

Linear Algebra: vector spaces, bases, dimension, vector spaces over finite fields, examples.

Basics of Combinatorics: rules of addition and multiplication, permutations, combinations with repetition and without, binomial coefficients and binomial theorem.

Calculus: limits of consequences, continuous functions, limits of functions, derivatives, Taylor series.

Probability: classical definition of event probability, geometrical probability model.

Beginning of the program - October 1, 2020.

Costof the program

The program welcomes any additional number of students selected by the committee.
The annual tuition fee is as low as 350 000 RUR.

Program partners

Our students have an opportunity to add an internship at Yandex research labs, Sberbank labs, 1C labs, Tinkoff labs, BioCad labs, ABBYY labs, Huawei labs, to their portfolio.

REVIEWS

Our School

School of Applied Mathematics and Computer Science of MIPT in a nutshell

1. Program included mathematics, physics and theoretical physics at the highest level possible in Soviet Union at that time.

2. World-renowned scientists were giving lectures, 8 of them later became Nobel Prize winners.

3. Not only lectures but also seminars were taught by professional researchers (at least of PhD level).

4. Starting from the third year of study students started participating in the cutting edge research at the best labs and research centers in Moscow.

1. MIPT has a nation-wide reputation and the best research labs, design engineering bureaus and businesses are competing to employ MIPT graduates. Specialists consider MIPT as one of the very best Russian Universities.

2. A significant part of the alumni take the scientific path and become fundamental researchers. Their education allow them to become the world leading scientists, like Nobel Prize Winners Andre Gaim and Konstantin Novoselov, the discoverers of graphene.

During the contest the ICPC team has interviewed Prof. Andrei Raigorodskii, the head of the MIPT School of Applied Mathematics and Informatics. The video interview is available on YouTube.

Other programs

ADVANCED COMBINATORICS
Two-year Master's program Phystech School of Applied Mathematics and Informatics (MIPT)

COMPUTER SCIENCE
Bachelor program Phystech School of Applied Mathematics and Informatics (MIPT)