+7 495 772-9590
27342
+7 495 772-9590
27334
Vereshchagin N., Milovanov A.
In bk.: 32nd Computational Complexity Conference. Вадерн: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 2017. P. 1-18.
Figurnov M., Collins M. D., Zhu Y. et al.
arXiv:1612.02297. arXiv. Cornell University, 2016
Contemporary discrete mathematics is a beautiful and multifaceted discipline boasting a wealth of fundamental problems and diverse high-tech applications.
Our seminar is aimed at students who want to study pure mathematics, and its practical applications. The seminar will host talks by young, active, specialists in discrete (combinational) mathematics, algorithm theory and computational complexity, combined (algebraic) topologies, combinational algebra and combinational geometry. The seminar will also host talks by R&D staff from Yandex, as it is in the IT sector and in the analysis of Internet structures that the ideas and approaches underlying discrete mathematics find their application.
See Seminar webpage for more detailed information.
Seminar moderators: Andrey Raigorodsky, Dmitry Shabanov, Alexander Dainiak, Alexey Shpilman, Andrei Leonidov, Andrei Romashchenko, Alexei Belov.