Одним из главных принципов уникальной «системы Физтеха», заложенной в основу образования в МФТИ, является тщательный отбор одаренных и склонных к творческой работе представителей молодежи. Абитуриентами Физтеха становятся самые талантливые и высокообразованные выпускники школ всей России и десятков стран мира.

Студенческая жизнь в МФТИ насыщенна и разнообразна. Студенты активно совмещают учебную деятельность с занятиями спортом, участием в культурно-массовых мероприятиях, а также их организации. Администрация института всячески поддерживает инициативу и заботится о благополучии студентов. Так, ведется непрерывная работа по расширению студенческого городка и улучшению быта студентов.

Адрес e-mail:

Program

The admission for the Program is annual, starting at 2015, with no future plans for discontinuance. Education lasts for two years and ends normally with defence of Master's Thesis.

Fall Semester 2015

Basics (elective, just for those who want to refresh their knowledge)

  1. Re-introduction to calculus.
  2. Re-introduction to algebra.
  3. Re-introduction to сombinatorics and graph theory.
  4. Re-introduction to probability.

“Re-introduction” does not only mean that “We again introduce you…”, but it also means that “We introduce you, say, to calculus looking at it from a bit more combinatorial point of view than it is usually done”.

Obligatory courses

  1. Advanced graph theory.
  2. Coding theory.
  3. Combinatorial geometry. Part 1.

Courses by visiting professors

  1. Janos Pach (EPFL, Lausanne) – Combinatorial geometry.

Other activities

  1. Interdepartmental seminar on Discrete Mathematics (every week).
  2. Seminar on Discrete Mathematics and its Applications in Network Analysis (every week at Yandex, the top Russian internet search engine).
  3. Research meetings with scientific advisors (office hours).

Spring Semester 2016

Main courses

  1. Game theory. Part 1.
  2. Random graphs. Part 1.
  3. Computational complexity.
  4. Combinatorial geometry. Part 2.

Courses by visiting professors

  1. David Gamarnik (MIT, USA) – Random graphs.
  2. G.O.H. Katona (Renyi Institute, Budapest) – Extremal theory of finite sets.

Other activities

  1. Interdepartmental seminar on Discrete Mathematics (every week).
  2. Seminar on Discrete Mathematics and its Applications in Network Analysis (every week at Yandex, the top Russian internet search engine).
  3. Research meetings with scientific advisors (office hours).

Fall Semester 2016

Main courses

  1. Game theory. Part 2.
  2. Random graphs. Part 2.
  3. Extremal combinatorics.
  4. Additive combinatorics.

Courses by visiting professors

  1. Benny Sudakov (ETH, Zurich) – Dependent Random Choice in Extremal Combinatorics.

Other activities

  1. Interdepartmental seminar on Discrete Mathematics (every week).
  2. Seminar on Discrete Mathematics and its Applications in Network Analysis (every week at Yandex, the top Russian internet search engine).
  3. Research meetings with scientific advisors (office hours).

Spring Semester 2017

Main courses

  1. Complex networks.
  2. Discrete optimization.
  3. Algebraic combinatorics.

Courses by visiting professors

  1. Prasad Tetali (GA Tech, USA) – TBA.

Other activities

  1. Interdepartmental seminar on Discrete Mathematics (every week).
  2. Seminar on Discrete Mathematics and its Applications in Network Analysis (every week at Yandex, the top Russian internet search engine).
  3. Research work and preparation of Master’s Thesis.
Если вы заметили в тексте ошибку, выделите её и нажмите Ctrl+Enter.

© 2001-2016 Московский физико-технический институт
(государственный университет)

Техподдержка сайта

МФТИ в социальных сетях

soc-vk soc-fb soc-tw soc-li soc-li
Яндекс.Метрика