Search

J. Koolen posed the problem of studying distance-regular graphs in which neighborhoods of vertices are strongly regular graphs with the second eigenvalue ≤ t for the given positive integer t. This problem is reduced to the des­cription of distance-regular graphs in which neighborhoods of vertices are strongly regular graphs with the non-principal eigenvalue t for t = 1, 2,… In the paper “Distance regular graphs in which local subgraphs are strongly regular graphs with the second eigenvalue at most 3”, A.A. Makhnev and D.V. Paduchikh found the arrays of intersections of distance-regular graphs in which neighborhoods of vertices are strongly regular graphs with the second eigenvalue t such as 2 < t ≤ 3. The graphs with intersection arrays {125,96,1;1,48,125}, {176,150,1;1,25,176}, and {256,204,1;1,51,256} remain unexplored. In this paper, we have found the possible orders and the structures of subgraphs of the fixed points of automorphisms of a distance-regular graph with the intersection array {125,96,1;1,48,125}. It has been proved that the neighborhoods of the vertices of this graph are pseudogeometric graphs for GQ(4,6). Composition factors of the automorphism group of a distance-regular graph with the intersection array {125,96,1;1,48,125} have been determined.

We study a problem concerning the estimation of the Hausdorff deviation of convex polygons in $\mathbb R^2$ from their geometric difference with circles of sufficiently small radius. Problems with such a subject, in which not only convex polygons but also convex compacts in the Euclidean space $\mathbb R^n$ are considered, arise in various fields of mathematics and, in particular, in the theory of differential games, control theory, convex analysis. Estimates of Hausdorff deviations of convex compact sets in $\mathbb R^n$ in their geometric difference with closed balls in $\mathbb R^n$ are presented in the works of L.S. Pontryagin, his staff and colleagues. These estimates are very important in deriving an estimate for the mismatch of the alternating Pontryagin’s integral in linear differential games of pursuit and alternating sums. Similar estimates turn out to be useful in deriving an estimate for the mismatch of the attainability sets of nonlinear control systems in $\mathbb R^n$ and the sets approximating them. The paper considers a specific convex heptagon in $\mathbb R^2$. To study the geometry of this heptagon, we introduce the concept of a wedge in $\mathbb R^2$. On the basis of this notion, we obtain an upper bound for the Hausdorff deviation of a heptagon from its geometric difference with the disc in $\mathbb R^2$ of sufficiently small radius.

The Capacitated Vehicle Routing Problem (CVRP) is a classical extremal combinatorial routing problem with numerous applications in operations research. Although the CVRP is strongly NP-hard both in the general case and in the Euclidean plane, it admits quasipolynomial- and even polynomial-time approximation schemes (QPTAS and PTAS) in Euclidean spaces of fixed dimension. At the same time, the metric setting of the problem is APX-complete even for an arbitrary fixed capacity q ≥ 3. In this paper, we show that the classical Haimovich-Rinnooy Kan algorithm implements a PTAS and an Efficient Polynomial-Time Approximation Scheme (EPTAS) in an arbitrary metric space of fixed doubling dimension for q = o(log log n) and for an arbitrary constant capacity, respectively. © 2019 Krasovskii Institute of Mathematics and Mechanics. All right reserved.

We considered the problem of obtaining upper bounds for the mathematical expectation of the $q$-norm ($2\leqslant q \leqslant \infty$) of the vector which is uniformly distributed on the unit Euclidean sphere. We finish the paper with numerical experiments illustrating our results., Comment: in Russian, 10 pages, 2 figures

The paper deals with the optimal control problem, including the linear parabolic equation as a state problem. Pointwise constraints are imposed on the control function. The objective functional involves the observation function in the entire space-time domain. The optimal control problem is approximated by a finite dimensional problem with mesh approximation of the state equation by the explicit (forward Euler) mesh scheme with variable time steps. The existence of unique solutions for the continuous and mesh optimal control problems is proved. The Uzawa-type iterative method is used for solving the finite dimensional optimal control problem. The results of numerical experiments are presented.

The paper is devoted to the expansion in partial fractions for a meromorphic function of one complex variable. It contains the results by the author on representing a meromorphic function as a sum of an entire function and the principal parts in its Laurent expansion at its poles.

Let $A_j,B_j$ $(j=0,1,\ldots)$ be $m \times m$ matrices, whose elements are complex numbers, $A_j$ are selfadjoint matrices and $B_j^{-1}$ exist. We study the deficiency index problem for minimal closed symmetric operator $L$ with domain $D_L$, generated by the Jacobi matrix $\textbf{J}$ with entries $A_j,B_j$ in the Hilbert space $l_m^2$ of sequences $ u=(u_0,u_1, \ldots), u_j \in C^m$ by mapping $u \rightarrow \textbf{J}u$, i.e. by the formula $Lu=lu$ for $u \in D_L$, where $lu=((lu)_0,(lu)_1, \ldots)$ and $$ (lu)_0:=A_0u_0+B_0u_1, \quad (lu)_j:=B^*_{j-1}u_{j-1}+A_ju_j+B_ju_{j+1}, \;\; j=1,2, \ldots $$ It is well known that the case of the minimal deficiency numbers of the operator $L$ corresponds to the determinate case, and the case of the maximal deficiency numbers of this operator corresponds to the completely indeterminate case of the matrix power moment problem. In this paper we obtain new conditions of the minimal, maximal and not maximal deficiency numbers of the operator $L$ in terms of the entries of the matrix $\textbf{J}$. The special attention is paid to the case $m=1$, i.e. we present some conditions on the elements of the numerical tridiagonal Jacobi matrix, which ensure the realization of the determinate case of the classical power moment problem., 9 pages, in Russian