Mathematical Problems of Cybernetics

Материал из Кафедра математической кибернетики
Версия от 13:34, 9 ноября 2021; SeleznevaSN (обсуждение | вклад)

(разн.) ← Предыдущая | Текущая версия (разн.) | Следующая → (разн.)
Перейти к: навигация, поиск

Математические вопросы кибернетики

The seminar is guided by Department of Discrete Mathematics (Faculty of Mechanics and Mathematics), by Department of Mathematical Theory of Intelligent Systems (Faculty of Mechanics and Mathematics), and by Department of Mathematical Cybernetics (Faculty of Computational Mathematics and Cybernetics) of Lomonosov Moscow State University.

The seminar objective is to discuss actual problems of mathematical cybernetics and a wide range of close topics, and to present the most significant results in these areas.

The seminar continues the research seminar on mathematical problems of cybernetics that had been guided by Sergey Vsevolodovich Yablonsky and by Oleg Borisovich Lupanov in Moscow University for more than 30 years.

2021-2022 academic year

In the 2021-2022 academic year the seminar is held distantly on Fridays 19:00 PM (Moscow time) according to announcements.

Sessions are held on the zoom platform, conference ID: 830 6246 3909, access code: 947173.

For questions related to the seminar’s work you can write to Svetlana Selezneva by e-mail mvk@cs.msu.ru.


List of talks

Date Title Speaker
26 November 2021 On research of completeness problem in the class of linear automata, functioning over subrings of the rational numbers. Abstract Dmitry V. Ronzhin (Moscow, Lomonosov Moscow State University)
19 November 2021 Boolean bijunctive functions and the systems of Boolean equations generated by them. Abstract Aleksey V. Tarasov (Moscow, Federal Educational and Methodological Association of Universities in the field of information security)
12 November 2021 Mathematical models of information transmission through noisy covert channels. Abstract Ilia B. Kazakov (Moscow, Lomonosov Moscow State University)
29 October 2021 Asymptotics for the logarithm of the number of k-free solutions sets in Abelian group. Abstract Vahe G. Sargsyan (Institute for Informatics and Automation Problems of the National Academy of Sciences of the Republic of Armenia)
22 October 2021 Discrete optimization in sport. Abstract Dmitry Dagaev (Moscow, HSE University)
8 October 2021 On the complexity of monomials systems computation by composition circuits. Abstract Sergey A. Korneev (Moscow, Lomonosov Moscow State University, Keldysh Institute of Applied Mathematics)