Invited speakers
The list of lecturers and topics of lectures will be found in this section, upon receipt of confirmation. Lecture courses are oriented to students and young scientists. The following leading scientists are probably planning to give some lectures at the conference:  Professor Alexander Ivanov, Imperial College London, Department of Mathematics, United Kingdom, London
"Classification of locally projective groups, graphs and amalgams"
Abstract: We consider bipartite edgetransitive graphs, such that the vertices in one part have valency 3 and the ones in the other have valency 7. The stabilizer of the vertex induces on the neighbours the group S3 or L3(2), depending on the valency. The goal is to classify the amalgams formed by the stabilizers of adjacent vertices.
 Professor Yuri Kochetov, Doctor of Physics and Mathematics, Chief Researcher of Sobolev's Institute of Mathematics SB RAS
"Logistic Mathematical models"
Abstract: An overview of mathematical models of discrete and combinatorial optimization from the field of production, transport and warehouse logistics will be presented. Particular attention will be paid to the game models (Stackelberg games), describing the competition in the markets. Numerical methods for solving such problems will also be discussed.
 Yelena Konstantinova, Associate Professor, PhD, Senior Researcher of Sobolev Institute of Mathematics SB RAS
"Greedy approach to the study of the cyclic structure of Cayley graphs"
Abstract: The report provides an overview of recent studies of the cyclic structure of Cayley graphs on a symmetric group. The main attention is paid to the "greedy approach" to the construction of cycles, as well as their connection with the generalized Gray codes. A wide variety of results of applying the "greedy approach" on various families of Cayley graphs is demonstrated.
 Professor Viktor Mazurov, Corresponding Member of RAS, Doctor of Physics and Mathematics. Sci., Senior Researcher, Institute of Mathematics SB RAS
"Classification of finite simple groups:forty years of mistrust"
Abstract: In 1980 there was an official announcement about the completion of the classification of finite simple groups (QGSG), which immediately aroused a wave of skepticism about the completeness of the list of these groups and the correctness of the relevant evidence. The lecture tells about what has changed over the years, and whether it is now possible to believe in the completeness of the GCC.
The lecture is canceled.
 Professor Denis Krotov, Doctor of Physics and Mathematics, Leading Researcher of Sobolev's Institute of Mathematics SB RAS
"On perfect colorings of the Hamming graph"
Abstract: A perfect coloring (also known as equitable partition, regular partition, partition design) of a graph is a vertex coloring such that vertices of the same color has the same color spectra of their neighborhoods. We discuss the construction of perfect colorings of the Hamming graphs H(n,q), mainly concentrated on 2colorings.
 Acad. Vitaliy Berdyshev, Academician of the Russian Academy of Sciences, Chief Researcher, Institute of Mathematics and Mechanics, Ural Branch of RAS
"Planning traffic in surveillance" Abstract: Let there be a corridor in which the device must pass from the initial to the final point in the presence of unfriendly observers. The extremal problem of searching the trajectory most hidden from observers is considered. It is intended to describe the set of all such trajectories.
 Professor Nikolay Lukoyanov , Corresponding Member of the Russian Academy of Sciences, Director of the Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences
"Positional Control in Dynamical Systems: The Problem of Guarantee Optimization"
Abstract: We consider a dynamical system controlled under interference conditions, in size commensurate with control. The quality of the process is evaluated on a finite time interval by a given indicator. Within the framework of the gametheoretic approach, the task is to find the optimal guaranteed result and construct a management strategy that ensures this result. The structure and properties of optimal strategies are discussed depending on the properties of the optimized quality index, the availability of resource constraints, and management delays. For a linearly convex case, methods for approximate solution of the problem are indicated, based on the retrograde construction of convex hulls of auxiliary program functions. Illustrative examples are given.
 Gromova Ekaterina Viktorovna, doctor of physical and mathematical sciences, Associate Professor of Chair of Mathematical Theory of Games and Statistical Solutions, St. Petersburg State University
"Nonantagonistic Dynamic Games. Cooperative Approach" Abstract: The modern state of the theory of dynamic (differential and multistep) games is discussed, and the main emphasis is on results using the achievements of cooperative game theory. In addition, applied mathematical models are given.
 Vladimir Ushakov, Corresponding Member of the Russian Academy of Sciences, Chief Researcher, Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences
"Problems on the approach of control systems on a finite time interval"
Abstract: The problems of control of nonlinear systems for a finite time interval are considered. Questions related to the construction of solving strategies in these problems are discussed. Model examples and algorithms for solving problems are given.
 Alexander Makhnev, Corresponding Member of the Russian Academy of Sciences, Chief Researcher, Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences
"Distanceregular Schilla Graphs"
Abstract: Schilla graphs were discovered by Kulen and Pak as distanceregular graphs of diameter 3 with a second eigenvalue reaching the minimum boundary. On the other hand, Yurisic and Vidali proved that a distanceregular graph of diameter 3 containing a maximal 1code that is locally regular and perfect with respect to the last neighborhood of the vertex has an intersection array {a(p+1), cp, a+1; 1 , c, ap} or {a(p +1),(a1)p,c;1,c,ap}, where a=a_3, c=c_2 and p=p^3_{33}. In the latter case, we obtain the Schilla graph with b_2 =c_2. The report will provide an overview of the results of Schilla graphs.
 Alexander Kovalevsky, Doctor of Sciences, Chief Researcher, Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences
"Degenerate anisotropic variational inequalities with L1data"
Abstract:We consider some notions of solution (Tsolution, shift Tsolution, and others) of the variational inequality corresponding to a nonlinear degenerate anisotropic elliptic secondorder operator, a sufficiently large set of constraints, and an L^1righthand side. We formulate theorems of existence and uniqueness of these solutions and describe their properties. The notion of Tsolution is related to the condition that the considered set of constraints contains bounded functions, and the notion of shift Tsolution does not require this condition. We give results on the relation of these notions and also show that, in the case of sufficiently regular righthand sides, the specified kinds of solutions coincide with the solution of the variational inequality in the usual sense.
 Anton Plaksin, Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences
"On the HamiltonJacobi equation in problems of control of systems of neutral type"
Abstract:The paper is devoted to the development of differential games theory and the corresponding HamiltonJacobi equations for functionaldifferential neutraltype systems. For a conflictcontrolled dynamical system described by functional differential equations of neutraltype in Hale’s form, we consider a differential game with a quality index that estimates the motion history and realizations of the players’ controls. Based on a coinvariant derivatives conception we derive a Hamilton–Jacobi equation. It is proved, firstly, that the solution of this equation, satisfying certain conditions of smoothness, is the value of the initial differential game, and secondly, that value at points of differentiability satisfies the considered Hamilton–Jacobi equation. Thus this equation can be interpreted as the Hamilton–JacobiIsaacs–Bellman equation for neutral type systems.
