Yakov Mikchailovich Erusalimskiy
+7(903) 432-86-64
Professor
Institute of Mathematics, Mechanics, and Computer Science named after of I.I. Vorovich
Research interests:
multiplicative discrete convolution operators, graph theory and algorithms on graphs, graphs with restrictions on achievability, combinatorics
Research projects:
Graphs with with restrictions on achievability: shortes paths, random walks, stationary and dynamic network flows with restrictions on achievability/
Head of research grants program "Universities of Russia" and "integration", the competitive center "Basic research", co-director of the Russian NATO Grant "Telecommunications: South Russia, Science and Education" grant individual mobility "Tempus -Tasis".
Teaching:
-
Algebra and Geometry
The course is divided into sections: analytical geometry on the plane (straight line and its equation, curves of the second order), vectors and operations on vectors, lines and planes in space, the system of linear equations, matrix algebra, determinants theory, complex numbers, polynomials, linear spaces, linear operators, Euclidean spaces, the theory of self-adjoint operators, bilinear and quadratic forms. (textbook "Algebra and Geometry" (Eruslimskiy I.M, Cherniavskaya I.A., Sfedu, 2011))
-
Discrete Mathematics
Contains sections: propositional algebra, algebra of sets and algebra of predicates, mapping, elements of combinatorics, Relations and Boolean matrix, Boolean functions, the theory of algorithms, graph theory and algorithms on the graphs. Textbook "Discrete Mathamatics: theory, tasks,applycations" (Erusalimskiy I.M. Vuzovskaia kniga, Moskow,12 ed., 2011)
