Search

One can notice that quite often difference between so-called "standard students" and "gifted" ones is not because that first are less smart, but they have different "orientation", they consider subject as a collections of rules which should not be broken. The first aim is to overcame this dogmatic point of view on this subject, and only after that possible to judge a person to be talented one or not. This is the first stage of math education, the material needs just to serve it. The technology of overcoming this wrong relation to subject is discoursed in spirit of the I.S.Rubanov paper "Method of Mathematical induction" (see chapter 9, http://www.ams.org/books/mawrld/007/). Giftness problems and staging of math (and scientific) education are discoursed., Comment: 6 pages, In Russian

A series of papers in the ISJAEE Journal on 'dam-free hydroelectric power station' concluded by paper: Zotyev, D. B., Alternative energy vs pseudo-science, ISJAEE. 2013. 8(130). P.131-136, is reviewed and commented. A comparison with the generally accepted energy conservation law in hydrodynamics reveals a disappointingly low scientific level of the reviewed papers (both pro- and contra- the dam-free concept), not excluding the published peer-reviewer reports. In the present version we emphasize that the ISJAEE journal published several papers, which neglect and reject the basic physical concepts, such as the Bernoulli integral, the energy conservation law in hydrodynamics, the wave function of photon and some others, with all these rejected concepts being far beyond the scientific scope of the journal. Some readers will be more concerned about the energy equation in hydrodynamics, in its theoretical form or in the Bernoulli integral form as being more traditional in technical hydromechanics. Some readers will be shocked with the statement that a photon does not possess the wave function. Overall, in this way or in that way, all readers will hardly stay unsurprised., Comment: 15 pages, in Russian. Submitted to ISJAEE

The paper studies the quantum action for the five-dimensional real $\phi^3$-theory in the case of a general formulation using the background field method. The three-loop renormalization is performed with the usage of a cutoff regularization in the coordinate representation. The explicit form of the first three coefficients for the renormalization constants is presented. The absence of non-local singular contributions and partial results for the fourth correction are discussed., Comment: LaTeX, 20 pages, 5 figures. Firstly appeared in Russian, April 9, 2024, see https://www.pdmi.ras.ru/preprint/2024/24-05.html

This paper presents the experience of developing and utilizing computer simulations for student laboratory assignments in atomic physics, specifically focusing on emission atomic spectra. The fundamental component of each laboratory assignment is a computer simulator of a spectrograph, which displays atomic line spectra on the monitor screen. The simulator operates by converting the wavelength of radiation into an RGB triplet. Calibration of the spectrograph is conducted using the atomic spectrum of mercury. The configuration of setup parameters and experimental conditions is unique to each student conducting the laboratory assignment using the simulator. Individualized parameters, stored in Google Sheets, are transferred to the HTML template of the laboratory assignment via the Google Apps Scripts service. This individualization of simulator parameters serves to encourage students to engage in independent work., Comment: 17 pages, in Russian, 9 figures

The paper discusses an applicability criterion for a cutoff regularization in the coordinate representation in the Euclidean space with a dimension larger than two. It is shown that the set of functions satisfying the criterion is not empty. As an example, an explicit function is presented. It is proved by explicit construction that there are functions satisfying the criterion in a stronger formulation., Comment: LaTeX, 8 pages, 1 figure. Firstly appeared in Russian, March 5, 2024. Compared to the Russian version, some comments and minor corrections have been added. The forgotten imaginary unit in the Fourier transform has also been restored. See https://www.pdmi.ras.ru/preprint/2024/24-04.html

The paper presents various modifications of the Frank-Wolfe algorithm in the equilibrium traffic assignment problem. The Beckman model is used as a model for experiments. In this article, first of all, attention is paid to the choice of the direction of the basic step of the Frank-Wolfe algorithm. Algorithms will be presented: Conjugate Frank-Wolfe (CFW), Bi -conjugate Frank-Wolfe (BFW), Fukushima Frank-Wolfe (FFW). Each modification corresponds to different approaches to the choice of this direction. Some of these modifications are described in previous works of the authors. In this article, following algorithms will be proposed: N-conjugate Frank-Wolfe (NFW), Weighted Fukushima Frank-Wolfe (WFFW). These algorithms are some ideological continuation of the BFW and FFW algorithms. Thus, if the first algorithm used at each iteration the last two directions of the previous iterations to select the next direction conjugate to them, then the proposed algorithm NFW is using more than N previous directions. In the case of Fukushima Frank-Wolfe, the average of several previous directions is taken as the next direction. According to this algorithm, a modification WFFW is proposed, which uses a exponential smoothing from previous directions. Experiments with various modifications were carried out on several datasets representing urban structures and taken from publicly available sources. The relative gap value was taken as the quality metric. The experimental results showed the advantage of algorithms using the previous directions for step selection over the classic Frank-Wolfe algorithm. In addition, an improvement in efficiency was revealed when using more than two conjugate directions. For example, on various datasets, the modification 3FW showed the best convergence. In addition, the proposed modification WFFW often overtook FFW and CFW, although performed worse than NFW., Comment: 14 pages, in Russian language, 8 figures

The paper tests the validity of the critique of the fiscal theory of the price level. A stochastic general equilibrium model with continuous time is constructed. An active fiscal policy and a passive monetary policy have been set. Monetary policy manages the interest rate through the Taylor rule. The stochastic default factor in the special form is introduced. A complete definite system of equations is obtained for the detection of equilibrium. It is asserted that the peculiarities of the approach to modeling are of critical importance for verifying the presence of certain hypotheses and formulating conclusions. The results of this work are in support of the fiscal theory of the price level., Comment: Master Thesis, in Russian. Supervisor: Sergey E. Pekarski

The search for equilibrium in a two-stage traffic flow model reduces to the solution of a special nonsmooth convex optimization problem with two groups of different variables. For numerical solution of this problem, the paper proposes to use the accelerated block-coordinate Nesterov-Stich method with a special choice of block probabilities at each iteration. Theoretical estimates of the complexity of this approach can markedly improve the estimates of previously used approaches. However, in the general case they do not guarantee faster convergence. Numerical experiments with the proposed algorithms are carried out in the paper., Comment: in Russian language

This paper considers a wide class of smooth continuous dynamic nonlinear systems (control objects) with a measurable vector of state. The problem is to find a special function (Lyapunov function), which in the framework of the second Lyapunov method guarantees asymptotic stability for the above described class of nonlinear systems. It is well known that the search for a Lyapunov function is the "cornerstone" of mathematical stability theory. Methods for selecting or finding the Lyapunov function to analyze the stability of closed linear stationary systems, as well as for nonlinear objects with explicit linear dynamic and nonlinear static parts, have been well studied (see works by Lurie, Yakubovich, Popov, and many others). However, universal approaches to the search for the Lyapunov function for a more general class of nonlinear systems have not yet been identified. There is a large variety of methods for finding the Lyapunov function for nonlinear systems, but they all operate within the constraints imposed on the structure of the control object. In this paper we propose another approach, which allows to give specialists in the field of automatic control theory a new tool/mechanism of Lyapunov function search for stability analysis of smooth continuous dynamic nonlinear systems with measurable state vector. The essence of proposed approach consists in representation of some function through sum of nonlinear terms, which are elements of object's state vector, multiplied by unknown coefficients, raised to positive degrees. Then the unknown coefficients are selected using genetic algorithm, which should provide the function with all necessary conditions for Lyapunov function (in the framework of the second Lyapunov method)., Comment: in Russian language

The article continues the work on the description of integrable nonlinear chains with three independent variables of the following form $u^j_{n+1,x}=u^j_{n,x}+f(u^{j+1}_{n}, u^{j}_n,u^j_{n+1 },u^{j-1}_{n+1})$ by the presence of a hierarchy of reductions integrable in the sense of Darboux, started in (1). The classification algorithm is based on the well-known fact that the characteristic algebras of Darboux integrable systems have a finite dimension. In this paper, we used the characteristic algebra in the direction $x$, whose structure for a given class of models is determined by some polynomial $P(\lambda)$, whose degree does not exceed three for known examples. The article assumes that $P(\lambda)=\lambda^2$, in this case the classification problem is reduced to finding eight unknown functions of one variable. In the paper, a rather narrow class of candidates for integrability is obtained, among which there is a new example of an integrable chain., Comment: in Russian language

The article is devoted to the problem of synthesis of observers of state variables for linear stationary objects operating under conditions of noise or disturbances in the measurement channel. The paper considers a fully observable linear stationary system with known parameters. It is assumed that the state variables are not measured, and the measured output variable contains a small amplitude (in general, modulo less than one) additive noise or disturbance. It is also assumed that there is no a priori information about the disturbance or noise in the measurement channel (for example, frequency spectrum, covariance, etc.). It is well known that a large number of methods of observer synthesis have been obtained for this type of objects, including the Kalman filter, which has proven itself in practice. Under the condition of complete observability and the presence of some a priori information about the process (which is typical for the case when a disturbance in the measurement channel can be represented as white noise), approaches based on Kalman filtering demonstrate the highest quality of convergence of estimates of state variables to true values. Without taking into account the numerous results obtained using the application of the Kalman filter, an alternative idea of constructing an observer of state variables is considered in this paper. The alternative of the new approach is primarily due to the fact that there is no need to use the usual approaches based on the Luenberger observer. The paper proposes an approach based on the evaluation of unknown parameters (in this case, an unknown vector of initial conditions of the variables of the object state) of a linear regression model., Comment: in Russian language

The paper is devoted to the study of combinatorial determinacy properties of a family of substitution complexes consisting of quadrilaterals glued side-to-side with each other. These properties are useful in constructing algebraic structures with a finite number of defining relations. In particular, this method was used when constructing a finitely presented infinite nisemigroup satisfying the identity x^9 =0. This construction responds to the problem of L. N. Shevrin and M. V. Sapir. In this paper, we investigate the possibility of coloring the entire sequence of complexes into a finite number of colors, in which the property of weak determinism is fulfilled: if the colors of the three vertices of a certain quadrilateral are known, then the color of the fourth side is uniquely determined, except in some cases of a special arrangement of the quadrilateral., Comment: in Russian language

This paper continues a series of papers in which 2-by-2 matrix joint solutions of two scalar evolutionary equations are constructed, which are analogs of the Schrodinger time equations. These equations correspond to the Hamiltonian system $H^{2+2+1}$, being one of the representatives of the hierarchy of degenerations of the isomonodromic Garnier system. The mentioned hierarchy was described by H. Kimura in 1986. In terms of solutions of linear systems of ordinary differential equations of the method of isomnodromic deformations, the compatibility condition of which are the Hamiltonian equations of the system $H^{2+2+1}$, the constructed joint matrix solutions of analogs of the time equations of the Schrodinger equations in this paper will be written out explicitly., Comment: in Russian language

The paper studies the quantum action for the four-dimensional real $\phi^4$-theory in the case of a general formulation using the background field method. The three-loop renormalization is performed with the usage of a cutoff regularization in the coordinate representation. The absence of non-local singular contributions and the correctness of the renormalization $\mathcal{R}$-operation on the example of separate three-loop diagrams are also discussed. The explicit form of the first three coefficients for the renormalization constants and for the $\beta$-function is presented. Consistency with previously known results is shown., Comment: LaTeX, 71 pages, 8 figures. Firstly appeared in Russian, February 6, 2024, see https://www.pdmi.ras.ru/preprint/2024/pr2024.html

This paper presents the experimental results on research of growth processes of GaAs layers on silicon substrates by molecular beam epitaxy. The formation of buffer Si layer in a single growth process has been found to significantly improve the crystalline quality of the GaAs layers formed on its surface, as well as to prevent the formation of anti-phase domains both on offcutted towards the [110] direction and on singular Si(100) substrates. It has been demonstrated that the use of cyclic thermal annealing at temperatures 350-660{\deg}C in the flow of arsenic atoms makes it possible to reduce the number of threading dislocations and increase the smoothness of the GaAs layers surface. At the same time, the article considers possible mechanisms that lead to an improvement in the quality of the surface layers of GaAs. It is shown that the thus obtained GaAs layers of submicron thickness on the singular Si(100) substrates have a mean square value of surface roughness 1.9 nm. The principal possibility of using thin GaAs layers on silicon as templates for forming on them light-emitting semiconductor heterostructures with active area based on self-organizing InAs quantum dots and InGaAs quantum well is presented. They are shown to exhibit photoluminescence at 1.2 um at room temperature., Comment: 18 pages, in Russian language, 6 figures

Generalizations of the theorems of Eberlein and Grothendieck on the precompactness of subsets of function spaces are considered: if $X$ is a countably compact space and $C_p(X)$ is a space of continuous functions in the pointwise topology convergence, then any countably compact subspace of the space $C_p(X)$ is precompact, that is, it has a compact closure. The paper provides an overview of the results on this topic. It is proved that if a pseudo-compact $X$ contains a dense Lindelof $\Sigma$-space, then pseudocompact subspaces of the space $C_p(X)$ are precompact. If $X$ is the product Cech complete spaces, then bounded subsets of the space $C_p(X)$ are precompact. Results on the continuity of separately continuous functions were also obtained., Comment: in russian

For fixed $k$, we consider the subgraph $YF_k=(V_k,E_k)$ of the famous Young--Fibonacci graph formed by the words with at most $k$ 2-s. The jump graph is a graded graph is defined as follows: each level is identified with $V_k$, and an edge between two vertices $(v_1,i)$ and $(v_{2},i+1)$, $v_1,v_2\in V_k$, of neighbouring levels us drawn iff $v_2$ is a descendant of $v_1$ in $YF_k$. The goal of this paper is to describe all central measures on the path space of $YF_k$., Comment: 24 pages, in Russian

In this paper, we consider two variants of the concept of sharp minimum for mathematical programming problems with quasiconvex objective function and inequality constraints. It investigated the problem of describing a variant of a simple subgradient method with switching along productive and non-productive steps, for which, on a class of problems with Lipschitz functions, it would be possible to guarantee convergence with the rate of geometric progression to the set of exact solutions or its vicinity. It is important that to implement the proposed method there is no need to know the sharp minimum parameter, which is usually difficult to estimate in practice. To overcome this problem, the authors propose to use a step djustment procedure similar to that previously proposed by B.~T.~Polyak., Comment: in Russian language

In this paper we propose a generalized condition for a sharp minimum, somewhat similar to the inexact oracle proposed recently by Devolder-Glineur-Nesterov. The proposed approach makes it possible to extend the class of applicability of subgradient methods with the Polyak step-size, to the situation of inexact information about the value of the minimum, as well as the unknown Lipschitz constant of the objective function. Moreover, the use of local analogs of the global characteristics of the objective function makes it possible to apply the results of this type to wider classes of problems. We show the possibility of applying the proposed approach to strongly convex non-smooth problems, also, we make an experimental comparison with the known optimal subgradient method for such a class of problems. Moreover, there were obtained some results connected to the applicability of the proposed technique to some types of problems with convexity relaxations: the recently proposed notion of weak $\beta$-quasi-convexity and ordinary quasi-convexity. Also in the paper, we study a generalization of the described technique to the situation with the assumption that the $\delta$-subgradient of the objective function is available instead of the usual subgradient. For one of the considered methods, conditions are found under which, in practice, it is possible to escape the projection of the considered iterative sequence onto the feasible set of the problem., Comment: in Russian language

The Fermat--Steiner problem is to find all points of the metric space Y such that the sum of the distances from each of them to points from some fixed finite subset A = {A_1, ..., A_n} of the space Y is minimal. This problem is considered in the case when Y=H(X) is the space of non-empty compact subsets of a finite-dimensional normed space X endowed with the Hausdorff metric, i.e. H(X) is a hyperspace over X. The set A is called boundary, all A_i are called boundary sets, and the compact sets that realize the minimum of the sum of distances to A_i are called Steiner compacts. In this paper, we study the question of stability in the Fermat--Steiner problem when passing from a boundary consisting of finite compact sets to a boundary consisting of their convex hulls. By stability here we mean that the minimum of the sum of distances does not change when passing to convex hulls of boundary compact sets. The paper continued the study of geometric objects, namely, hook sets that arise in the Fermat--Steiner problem. The results obtained revealed some geometry of the relationship between Steiner compacts and boundary sets. On its basis, a sufficient condition for the instability of the boundary in H(X) was derived., Comment: in Russian language

In the development of materials for structural purposes, the main focus is on the advantageous combination of mechanical and volume-mass properties. Due to the development of production, solid plates are increasingly being replaced by modern composite materials with improved properties, one of the varieties of which is layered composites with a honeycomb core. The most widespread are three-layer plates with solid face layers and a hexagonal honeycomb core. However, with the development of new technologies, including 3D printing, honeycombs with new geometries are gaining popularity, the mechanical properties of which make it possible to obtain layered composites with improved features. In this paper, three-layer plates with solid face layers and a tetrachiral honeycomb core are investigated. The influence of discretization (number of unit cells), relative density and thickness of the honeycomb core on the stress state of three-layer composites subjected to static bending under various boundary conditions is studied. Mathematical modeling is carried out within the framework of the theory of elasticity by the finite element method via three-dimensional modeling in the Comsol Multiphysics system, as well as using algorithms developed by the author for analyzing the stress state of multilayer plates with tetrachiral honeycombs by solving a plane problem of the theory of elasticity. As a result, good agreement is shown between the numerical results obtained using algorithms for solving a plane problem and via three-dimensional finite element modeling in the Comsol Multiphysics system, while the numerical results are qualitatively consistent with laboratory test data., Comment: in Russian language

Our previous paper shows that the (vertex) spanning tree degree enumerator polynomial of a connected graph $G$ is a real stable polynomial (id est is non-zero if all variables have positive imaginary parts) if and only if $G$ is distance-hereditary. In this note we generalize the result on weighted graphs. This generalization allows us to define the class of weighted distance-hereditary graphs., Comment: in Russian

The paper investigates the behavior of 0 degree domain boundaries arising in uniaxial magnetic films with flexomagnetoelectric effect in a magnetic field. It is shown that at certain orientations of the magnetic field, it is possible to significantly enhance (or weaken) the degree of manifestation of the flexomagnetoelectric effect in the studied films. In addition, by varying the magnitude and directions of the magnetic field, it is possible to significantly lower (up to zero) the value of the critical electric field of the origin of this inhomogeneity. It is also established that a 0 degree domain boundary of non-Anelian type, in which induced bound charges do not create a resultant field (field shielding), when a magnetic field directed perpendicular to the plane of rotation of magnetic moments is applied, a flexomagnetoelectric effect occurs, which increases with increasing magnitude of the magnetic field., Comment: 9 pages, in Russian language, 12 figures

The deployment of the Baikal-GVD deep underwater neutrino telescope is continuing in Lake Baikal. By April 2022, ten clusters of the telescope were put into operation, with 2880 optical modules in total. One of the relevant tasks in this context is to study the possibilities of increasing the efficiency of the detector based on the experience of its operation and the results obtained at other neutrino telescopes in recent years. In this paper, a variant of optimizing the configuration of the telescope is considered, based on the installation of additional strings of optical modules between the clusters (external strings). An experimental version of the external string was installed in Lake Baikal in April 2022. This paper presents a first estimate of the impact of adding external strings on the neutrino detection efficiency, as well as the technical implementation of the detection and data acquisition systems of the external string and first results of its in-situ tests., Comment: 12 pages, in Russian language, 7 figures, 1 Table

This paper studies non-smooth problems of convex stochastic optimization. Using the smoothing technique based on the replacement of the function value at the considered point by the averaged function value over a ball (in $l_1$-norm or $l_2$-norm) of small radius with the center in this point, the original problem is reduced to a smooth problem (whose Lipschitz constant of the gradient is inversely proportional to the radius of the ball). An important property of the smoothing used is the possibility to calculate an unbiased estimation of the gradient of a smoothed function based only on realizations of the original function. The obtained smooth stochastic optimization problem is proposed to be solved in a distributed federated learning architecture (the problem is solved in parallel: nodes make local steps, e.g. stochastic gradient descent, then they communicate - all with all, then all this is repeated). The goal of this paper is to build on the current advances in gradient-free non-smooth optimization and in feild of federated learning, gradient-free methods for solving non-smooth stochastic optimization problems in federated learning architecture., Comment: In Russian language. Redesigned version for publication in the journal Computational Mathematics and Mathematical Physics

In 2010s Fleiner introduced a notion of stable flows in directed networks and showed that such a flow always exists and can be found by use of a reduction to the stable allocation problem due to Baiou and Balinski. Recently Cseh and Matuschke devised a direct strongly polynomial algorithm. In this paper we give an alternative algorithm to find a stable flow in a network with several sources and sinks. It is based on an idea of preflows (appeared in 1970s in a faster algorithm for the classical max-flow problem), and runs in $O(nm)$ time for a network with $n$ vertices and $m$ edges. The results are further generalized to a larger class of objects, so-called stable quasi-flows with bounded excesses in non-terminal vertices. (The paper is written in Russian.), Comment: 19 pages, in Russian language. Compared with the previous version, the reference to a grant is removed

This is the third part of a cycle of papers devoted to the construction of a finitely presented infinite nil-semigroup satisfying the identity $x^9 = 0$. This construction answers the problem of L. N. Shevrin and M. V. Sapir, posed, for example, in the Sverdlovsk notebook. A semigroup is realized as a set of path encodings on a family of special uniformly elliptic complexes. In the first paper of the cycle Finitely defined nil semigroup: complexes with uniform ellipticity, a sequence of complexes was constructed with a set of geometric properties. In the second work of the series Deterministic Coloring of a Family of Complexes a finite letter encoding was introduced on the vertices and edges of the constructed complexes. The deterministic property of such a coloring was proved, which makes it possible to introduce a finite set of defining relations on the set of words-codings of paths on complexes. In this paper, we describe an algorithm for reducing an arbitrary semigroup word to canonical form. It is also proved that a word containing a subword with period 9 can be reduced to zero using defining relations. Word encodings corresponding to sufficiently long paths are not reduced to zero and do not change their length, that is, the introduced semigroup is infinite., Comment: in Russian. The work was carried out with the help of the Russian Science Foundation, Grant 22-11-00177. The first author is the winner of the Young Mathematics of Russia competition

In this paper we establish necessary condition for the Freiheitsatz of Magnus can be extended to free pro-${\it p}$-groups, Comment: 6 pages, in Russian

In this paper we study a generalization of distributed conditional gradient method to time-varying network architectures. We theoretically analyze convergence properties of the algorithm and provide numerical experiments. The time-varying network is modeled as a deterministic of a stochastic sequence of graphs., Comment: In Russian language

The paper considers approaches to saddle point problems with a two-sided variant of the Polyak-Lojasievich condition based on the gradient method with inexact information and proposes a stopping rule based on the smallness of the norm of the inexact gradient of the external subproblem. Achieving this rule in combination with a suitable accuracy of solving the auxiliary subproblem ensures that the quality of the original saddle point problem is acceptable. The results of numerical experiments for various saddle point problems are discussed to illustrate the effectiveness of the proposed method, including the comparison with proven convergence rate estimates., Comment: in Russian language

We study the global behavior of the trajectories of the polynomial system $\dot x = x - x^2 y+p x y^2+ y^3, \ \dot y=y+p y^3 , \ \ p\in \mathbb{R}$. Our study is related to the paper {\it Alarcon B., Castro S.B.S.D., Labouriau I.S.} Glodal planar dynamics with star nodes: beyond Hilbert's 16th problem//arXiv:2106/07516v2 [math.DS]., Comment: 8 pages, 4 figures, in Russian

Decision forest (decision tree ensemble) is one of the most popular machine learning algorithms. To use large models on big data, like document scoring with learning-to-rank models, we need to evaluate these models efficiently. In this paper, we explore MatrixNet, the ancestor of the popular CatBoost library. Both libraries use the SSE instruction set for scoring on CPU. This paper investigates the opportunities given by the AVX instruction set to evaluate models more efficiently. We achieved 35% speedup on the binarization stage (nodes conditions comparison), and 20% speedup on the trees apply stage on the ranking model., Comment: in Russian language

In the monograph "Strong artificial intelligence. On the Approaches to Superintelligence" contains an overview of general artificial intelligence (AGI). As an anthropomorphic research area, it includes Brain Principles Programming (BPP) -- the formalization of universal mechanisms (principles) of the brain work with information, which are implemented at all levels of the organization of nervous tissue. This monograph contains a formalization of these principles in terms of category theory. However, this formalization is not enough to develop algorithms for working with information. In this paper, for the description and modeling of BPP, it is proposed to apply mathematical models and algorithms developed earlier, which modeling cognitive functions and base on well-known physiological, psychological and other natural science theories. The paper uses mathematical models and algorithms of the following theories: P.K.Anokhin Theory of Functional Brain Systems, Eleanor Rosch prototypical categorization theory, Bob Rehder theory of causal models and "natural" classification. As a result, a formalization of BPP is obtained and computer experiments demonstrating the operation of algorithms are presented., Comment: 28 pages, in Russian, 4 figures

Let $Z$ and $W$ are distributions of points on the complex plane $\mathbb C$. The following problem goes back to the studies of F. Carlson, T. Carleman, L. Schwartz, A. F. Leont'ev, B. Ya. Levin, J.-P. Kahane and others. For which $Z$ and $W$ for an entire function $g\neq 0$ of exponential type vanishing on $W$, there is an entire function $f\neq 0$ of exponential type vanishing on $Z$ such that $|f|\leq |g|$ on the imaginary axis? The classical Malliavin-Rubel theorem of the early 1960s completely solves this problem for "positive" $Z$ and $W$ lying only on the positive semiaxis. A number of generalizations of this criterion were established by us in the late 1980s for "complex" $Z\subset\mathbb C$ and $W\subset\mathbb C$ separated by angles from the imaginary axis, with some advances in the 2020s. In this paper, tougher problems are solved in a more general subharmonic framework for distributions of masses on $\mathbb C$. All the previously mentioned results can be obtained from the main results of the paper in a much stronger form even in the initial formulation for distributions of points $Z$ and $W$ and entire functions $f$ and $g$ of exponential type. Some of the results of the article are closely related to the famous Beurling-Malliavin theorems on the radius of completeness and the multiplier., Comment: 49 pages, in Russian

In the paper we consider a stochastic model which called Markov Q-processes that forms a continuous-time Markov population system. Markov Q-processes are defined as stochastic Markov branching processes with trajectories continuing in the remote future. Estimation of the structural parameter of the Markov Q-process is the main goal of this paper. To estimate this parameter, an unbiased estimator of the Lotka-Nagaev type is proposed. An asymptotic expansion of the variance of this estimator is found., Comment: in Russian language

The paper answers the question posed in a joint paper by A. A. Klyachko and N. M. Luneva about the optimality of the estimate for the cost of symmetry in graphs. The original estimate says that if n vertices can be removed from a connected graph so that there is no connected subgraph of isomorphic $\Gamma$ left in it, then at most $n|V(\Gamma)|$ vertices that form a set invariant under all automorphisms of the graph so that the graph does not contain a subgraph isomorphic to $\Gamma$. We will prove that there exists a graph $\Gamma$ for which this estimate is not optimal., Comment: in Russian language

This paper considers a general problem of convex stochastic optimization in a relatively low-dimensional space (e.g., 100 variables). It is known that for deterministic convex optimization problems of small dimensions, the fastest convergence is achieved by the center of gravity type methods (e.g., Vaidya's cutting plane method). For stochastic optimization problems, the question of whether Vaidya's method can be used comes down to the question of how it accumulates inaccuracy in the subgradient. The recent result of the authors states that the errors do not accumulate on iterations of Vaidya's method, which allows proposing its analog for stochastic optimization problems. The primary technique is to replace the subgradient in Vaidya's method with its probabilistic counterpart (the arithmetic mean of the stochastic subgradients). The present paper implements the described plan, which ultimately leads to an effective (if parallel computations for batching are possible) method for solving convex stochastic optimization problems in relatively low-dimensional spaces., Comment: 9 pages, in Russian

The paper proposes an adaptive observer of the state vector of a nonlinear time varying system based on measurements of the output variable. The problem is solved under the assumption that the control matrix (vector) and the nonlinear component of the equation of state of the system contain unknown constant parameters. When developing an adaptive observer, the GPEBO (generalized parameter estimation based observer) method was used, also known as a generalized observer based on parameter estimation, which was proposed in [1]. During the synthesis of the observer, a preliminary parametrization of the original nonlinear system is carried out. Then the resulting system is reduced to a linear regression model. At the next stage, unknown constant regression parameters are estimated using the least squares method with the forgetting factor [2, 3]. The article suggests the development of the result proposed by the authors in [4]. In [4], a linear non-stationary system containing unknown parameters in a control matrix (vector) was considered. This result is an extension of the result obtained in [4] for the case when the equation of state of the system contains a partially unknown nonlinearity., Comment: in Russian language

In this paper we consider multi-stages traffic assignment with several demand layers, user types and network types. We consider two stages: demand matrix calculation (Entropy Wilson's model) and traffic assignment models (Beckmann or Nesterov--de Palma). For the traffic assignment stage we use dual reformulation and combine these stages as a saddle-point problem (convex-concave). Then we discuss how one can solve this problem numerically., Comment: in Russian language. This research was supported by the annual income of the MIPT Foundation (Endowment No. 5 for the development of artificial intelligence and machine learning at MIPT)

A method for solving the inverse problem of designing the structure of a one-dimensional photonic crystal is proposed and experimentally implemented. It is known that a one-dimensional photonic crystal with a spatial sinusoidal modulation of the refractive index, has a narrow photonic bandgap at a frequency related to the spatial frequency of this sinusoid. We propose a reverse engineering method for one-dimensional photonic crystals with an arbitrary given reflection spectrum by expanding this spectrum into elementary photonic band gaps and then summing them. This paper shows the application of this method to fabricate examples of photonic crystals with simple shapes of spectral reflection curves., Comment: in Russian language

The paper presents a theoretical approach to the description of the relativistic scattering of a massive (neutral) lepton on a nucleus, in which the latter retains its integrity. The measurable cross section of this process includes the elastic (or coherent) contribution, when the nucleus remains in its original quantum state and the inelastic (incoherent) contribution, when the nucleus goes into another (excited) quantum state. Transition from the elastic scattering regime to the inelastic scattering regime is regulated automatically by the dependence of the form factors on the momentum transferred to the nucleus. At small momentum transfers elastic scattering dominates. AS the transferred momentum increases, the contribution of the inelastic scattering increases, and the latter becomes dominant at sufficiently large transferred momenta. The scattering of massive (anti)neutrinos interacting with nucleons through the $V\mp A$ currents of the Standard Model is considered in detail. Because of the nonzero masses, an additional channel arises for elastic and inelastic scattering of these (anti)neutrinos on nuclei due to the possibility of changing the helicity of these (anti)neutrinos. The expressions obtained for the cross sections are applicable to any precision data analysis involving neutrinos and antineutrinos, especially when non-zero neutrino masses can be taken into account. These expressions can also be used in the analysis of experiments on direct detection of (neutral) massive weakly interacting relativistic dark matter particles since, unlike the generally accepted case, they simultaneously take into account both elastic and inelastic interactions of the particles. The presence of an "inelastic signal" with its characteristic signature may be the only registrable evidence of interaction of the dark matter particle with the nucleus., Comment: 60 pages, 3 figures, to be published in Physics of Elementary Particles and Atomic Nuclei (in Russian)

The possibilities of organizing an observation service for solar activity in order to provide space weather forecasting are considered. The most promising at this stage is the creation of a ground-based observation network. Such a network should include solar magnetographs that provide observation of large-scale magnetic fields of the Sun, and patrol optical telescopes designed to detect coronal mass ejections and solar flares. The data of magnetographic observations provide an assessment of recurrent solar winds. Patrol telescopes operating in continuous mode allow detecting the moments of eruption and determining the parameters of coronal mass ejections at the initial stage of acceleration. The network service can be supplemented with other types of observations in the radio and optical bands. The paper considers the composition of observational tools, as well as methods and models for forecasting., Comment: 26 pages, in Russian language, 14 figures, 1 table

In paper this paper it is considered the summation problem for trigonometric integrals with quadratic phase. This problem considered in the papers \cite{Chub},\cite{Chax},\cite{Jabbar} in particular cases. Our results generalized the results of that papers to multidimensional trigonometrical integrals., Comment: in Russian

This paper proposes a method for ranking the investment attractiveness of exchange-traded stocks where investment risk is not related to the volatility indicator but instead is related to the indicator of compression of the time series of price changes. The article describes in detail the ranking algorithm, provides an example of ranking the shares of all companies included in the Dow Jones stock index. The paper additionally compares the results of ranking these stocks by volatility and compression and also shows the strengths of the second indicator, which is formed using the method of binary-ternary compression of historical financial data., Comment: in Russian

This paper solves the problem of station-keeping control of a surface vessel under conditions of sinusoidal disturbances with unknown parameters. The proposed control algorithm is based on the geometric approach with the use of the adaptive internal model and the extended observer. The paper analytically proves the boundedness of the trajectories of the system and their semiglobal convergence to an arbitrarily small set. The performance of the algorithm is illustrated by computer simulation., Comment: in Russian

This review summarizes papers which analyze impact of self-citation on research evaluation. We introduce a generalized definition of self-citation and its variants: author, institutional, country, journal, discipline, publisher self-citation. Formulae of the basic self-citation measures are given, namely self-citing and self-cited rates. World literature on author, institutional, country and journal self-citation is studied in more detail. Current views on the role and impact of self-citation are compiled and analyzed. It is found that there is a general consensus on some points: (a) pathological is as excessive self-citation so its total absence; (b) self-citation has low impact on large science units but may be critical for analysis of individual researchers; (c) share of self-citations is generally higher for units with low bibliometric performance, while top scientists, institutions, journals receive the majority of their citations from outside. This review also considers how bibliometric instruments and databases respond to challenge of possible manipulation by self-citations and how they correct bibliometric indicators calculated by them. The first part of the review presented here deals with the fundamental terms and definitions, and the most discussed and studied type of the self-citation, author self-citation. The paper was funded by RFBR, project number 20-111-50209, Comment: In Russian. Preprint. To be published in "Scientific and Technical Libraries" ("Nauchnye i Tekhnicheskie Biblioteki")

In 1949 V.A. Rokhlin introduced into ergodic theory the k-fold mixing and puzzled the mathematical community with the problem of the mismatch of these invariants. Here's what Rokhlin wrote: "The proposed work arose from the author's attempts to solve the well-known spectral problem of the theory of dynamical systems: are there any metrically different dynamical systems with the same continuous (in particular, Lebesgue) spectrum? Using new metric invariants introduced for this purpose, the author tried to find among the ergodic automorphisms of compact commutative groups automorphisms of various metric types. It turned out, however, that for all the indicated automorphisms the new invariants are exactly the same." We discuss this long time open problem., Comment: in Russian language

The function $P(T)=\sum_{i=0}^\infty c_i T^i$ is admissible if $c_i\geq 0$, $\sum_{i=0}^\infty c_i\leq 1$. For any given set of admissible functions $P_1,\dots, P_k$ there is a unitary operator $T$ of dynamic origin such that the weak closure of its powers is a semigroup generated by the operators $0$, $T$, $P_1(T),\dots, P_k(T)$, $T^\ast$, $P_1(T^\ast ),\dots, P_k(T^\ast)$., Comment: in Russian language

We generalize methods, developed by S. Ghilardi, and apply them to a subsystem J$_2$ of bimodal provability logic GLB. We describe projective formulas in J$_2$ in terms of Kripke semantics and prove that logic J$_2$ has finitary unification type. As an application, we show that admissibility problem for J$_2$ is decidable., Comment: In Russian, 20 pages

In this expository note we show how combinatorial Nullstellensatz by N. Alon naturally appears in solutions of elementary problems. Simple ideas gradually and naturally appear in such solutions, thus bringing a reader to generalizations. The note is accessible to mathematicians not specialized in the area, and to students familiar with polynomials., Comment: 9 pages; in Russian