?
Комбинаторный инвариант для поверхностных диффеоморфизмов Морса-Смейла с ориентируемой гетероклиникой
Журнал Средневолжского математического общества. 2020. Т. 22. № 1. С. 71–80.
Morozov A., Pochinka O.
In the present paper, we consider the class of orientation-preserving Morse-Smale diffeomorphisms f defined on an orientable surface M2. The work of A. A. Beznezhennykh and V. Z. Grines showed that such diffeomorphisms have a finite number of heteroclinic orbits. In addition, the classification problem of the diffeomorphisms under consideration is reduced to the problem of distinguishing orientable graphs with permutations describing the geometry of a heteroclinic intersection. However, such graphs generally do not admit polynomial distinguishing algorithms. This article proposes a new approach to the classification of cascade data. For this, each diffeomorphism f under consideration is assigned a graph whose embeddability in the ambient surface makes it possible to construct an effective algorithm for distinguishing such graphs.
Keywords: диффеоморфизм Морса-СмейлаMorse – Smale diffeomorphismorientation preserving diffeomorphismtopological invariant of diffeomorphismsurface diffeomorphism orientable heteroclinicтопологический инвариант диффеоморфизмаповерхностный диффеоморфизмориентируемая гетероклиникасохраняющий ориентацию диффеоморфизм
Publication based on the results of:
Kuninets A., Malygina E., Leevik A. G. et al., Journal of Computer Virology and Hacking Techniques 2026 No. 22 Article 62
In this work, we investigate the application of Barnes–Wall lattices in post-quantum cryptographic schemes. We survey and analyze several constructions of Barnes–Wall lattices, including subgroup chains, the generalized k-ing construction, and connections with Reed-Muller codes, highlighting their equivalence over both Z[i] and Z. Building on these structural insights, we introduce a new algorithm for efficient ...
Added: July 16, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Chow polylogarithms are some special functions arising in explicit description of the Beilinson regulator map. The most interesting functional equation for this function reflects its vanishing on the boundary in the Bloch's cycle complex. We show that this functional equation formally follows from more simple ones, namely skew-symmetry, functoriality and multiplicativity.
To prove this, we study ...
Added: July 16, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Let K be a field of characteristic zero. We prove that its motivic cohomology in degree m−1 and weight m is rationally isomorphic to the cohomology of the polylogarithmic complex. This gives a partial extension of A. Suslin theorem describing the indecomposable K3 of a field. ...
Added: July 16, 2026
Zapryagaev A., Pahomov F., Logic Journal of the IGPL 2026 Vol. 34 No. 4 Article 12
We prove the linear orders first-order definable in the standard model (Z;<,+) of Presburger arithmetic are exactly those that are (Z;<,+)-definably embeddable into the lexicographic ordering on Z^n for some n. ...
Added: July 16, 2026
Veretennikov A., Veretennikova M., Reliability: Theory & Applications 2022 Vol. 17 No. 3(69) P. 273–291
A simple model of the new notion of ``Markov up'' processes is proposed; its positive recurrence and ergodic properties are shown under the appropriate conditions. ...
Added: July 16, 2026
Veretennikov A., Stochastics and Partial Differential Equations: Analysis and Computations 2022 Vol. 10 P. 1165–1179
Positive recurrence of a $d$-dimensional diffusion with an additive Wiener process, with switching and with one recurrent and one transient regimes and variable switching intensities is established under suitable conditions. The approach is based on embedded Markov chains. ...
Added: July 15, 2026
Veretennikov A., Queueing Systems 2022 Vol. 100 No. 3-4 P. 357–359
B.A. Sevastyanov's result about Erlang telephone station problem has been extended in several publications. In this short note one open question about this model has been discussed. The whole volume was devoted mainly to open problems related to the name of Erlang. ...
Added: July 15, 2026
Physical Review E - Statistical, Nonlinear, and Soft Matter Physics 2026 Vol. 114 No. 1 P. 014217–014217
This study investigates the dynamical origins and statistical properties of extreme events (EEs) in a diffusively coupled theoretical Brusselator system, extending from pairwise interactions to globally coupled networks. Statistically, the emergence of EEs is characterized by heavy-tailed probability density functions and exponential interevent interval distributions, alongside an analysis of the complementary cumulative distribution function and ...
Added: July 15, 2026
Prokofev V., Zabrodin A., Proceedings of the Steklov Institute of Mathematics 2020 Vol. 309 P. 225–239
We consider solutions of the matrix Kadomtsev-Petviashvili (KP) hierarchy that are trigonometric functions of the first hierarchical time t1 = x and establish the correspondence with the spin generalization of the trigonometric Calogero-Moser system at the level of hierarchies. Namely, the evolution of poles xi and matrix residues at the poles aαibβi of the solutions with respect to the kth hierarchical time of the ...
Added: July 14, 2026
Prokofev V., Zabrodin A., Journal of Physics A: Mathematical and Theoretical 2021 Vol. 54
We consider solutions of the Kadomtsev–Petviashvili hierarchy which are elliptic functions of x = t1. It is known that their poles as functions of t2 move as particles of the elliptic Calogero–Moser model. We extend this correspondence to the level of hierarchies and find the Hamiltonian Hk of the elliptic Calogero–Moser model which governs the dynamics of poles with respect to the kth ...
Added: July 14, 2026
Prokofev V., Zabrodin A., Theoretical and Mathematical Physics 2021 Vol. 208 P. 1093–115
We consider solutions of the 2D Toda lattice hierarchy which are elliptic functions of the zeroth time t_0=x. It is known that their poles as functions of t_1 move as particles of the elliptic Ruijsenaars-Schneider model. The goal of this paper is to extend this correspondence to the level of hierarchies. We show that the ...
Added: July 14, 2026
Prokofev V., Zabrodin A., Теоретическая и математическая физика 2023 Т. 217 № 2 С. 299–316
We continue the study of the B-Toda hierarchy (the Toda lattice with the constraint of type B), which can be regarded as a discretization of the BKP hierarchy. We introduce the tau function of the B-Toda hierarchy and obtain bilinear equations for it. Examples of soliton tau functions are presented in explicit form. ...
Added: July 14, 2026
Шиманогов И. Н., Vyalyi M., Дискретный анализ и исследование операций 2025 Т. 32 № 4(166) С. 213–230
A well-studied class of algorithmic problems is that of regular realizability: checking the non-emptiness of the intersection of a regular language with a given language. This problem has a natural algebraic interpretation: verifying whether an element of a Boolean algebra belongs to the kernel of a certain homomorphism. This motivates the consideration of an analogous ...
Added: July 12, 2026
Rybakov M., Annals of Pure and Applied Logic 2026 Vol. 177 Article 103811
The paper presents a solution to the question about the decidability of the two-variable fragment of the superintuitionistic predicate logic QLC defined by the class of linear Kripke frames, which is also the ‘superintuitionistic’ fragment of the modal predicate logic QS4.3, under the Gödel translation. We prove that the fragment is undecidable. The result remains true for the ...
Added: July 11, 2026
Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.
This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...
Added: July 9, 2026
Springer, 2027.
The series Lecture Notes in Computer Science (LNCS), including its subseries Lecture Notes in Artificial Intelligence (LNAI) and Lecture Notes in Bioinformatics (LNBI), has established itself as a medium for the publication of new developments in computer science and information technology research, teaching, and education. LNCS enjoys close cooperation with the computer science R & ...
Added: July 8, 2026
Маликов М. А., Монахова Э. А., Rzaev E. et al., Ученые записки Казанского университета. Серия: Физико-математические науки 2026 Т. 168 № 2 С. 269–286
This article examines series of families of two-dimensional circulant networks with rectangular
L -shapes, optimal in diameter, as network-on-chip topologies with a minimal number of crossings
between the links and a bounded length of the maximum link that does not depend on the network
size. New network-on-chip routing algorithms, which use the coordinates of three adjacent zeros in
the ...
Added: July 8, 2026
Pilé I., Deng Y., Shchur L., Physical Review B: Condensed Matter and Materials Physics 2026 Vol. 114 No. 1 Article 014101
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Swendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for models in different universality classes: Ising model, Potts model with three components, and four-state Potts model. The overlap of two ...
Added: July 6, 2026
Irkutsk: ISDCT SB RAS, 2026.
We study a model problem on the filtration of a conducting fluid through a
porous layer. A porous medium is presented as an assemblage of identical spherical
cells. Each cell consists of a porous core and liquid shell. We derive apriori estimates
for flow characteristics which show the specific behavior of the fluid. Our estimates
are validated numerically. ...
Added: July 5, 2026
М.: Наука и технологии, 2026.
«Телекоммуникации» ежемесячный рецензируемый производственный, информационно-аналитический и учебно-методический журнал выходит в свет с июля 2000 г.
Для руководителей и работников промышленности, научно-исследовательских и проектно-конструкторских институтов, высших учебных заведений, аспирантов и студентов, а также для специалистов, разрабатывающих, выпускающих и эксплуатирующих средства телекоммуникаций.
Новости разработок и производства, прогнозы развития, защита информации, Нормативные, справочные, аналитические и учебно-методические материалы.
Переход к глобальному информационному ...
Added: July 4, 2026
МФТИ, 2025.
абота редакции научного журнала «Труды Московского физико-технического института» (кратко «Труды МФТИ»), редакционной коллегии и редакционного совета осуществляется в соответствии с Положением, утвержденным ректором института. В состав редакционной коллегии входят руководители института, факультетов, институтских и факультетских кафедр. Главный редактор журнала —президент МФТИ, член-корр. РАН Кудрявцев Н.Н.
Журнал «Труды МФТИ» входит в базу данных РИНЦ (Российский Индекс Научного Цитирования) и доступен в электронной ...
Added: July 4, 2026
Konakov V., Kucher D., Mammen E., / Series arXiv "math". 2026. No. 2606.11142v1.
In this paper, we construct strong approximations for discrete-time Markov chains weakly converging to continuous diffusion processes, as well as for their perturbed counterparts. Under the assumption of bounded coefficients, we construct closely coupled versions of these processes on a shared probability space. In particular, for both non-degenerate and degenerate cases, we maximize the probability ...
Added: June 11, 2026
Dorovskiy A., / Series arXiv "math". 2026.
In this paper the structural stability of generic families of vector fields of the PC-HC class on the two-dimensional sphere is proved. A classification of these families up to moderate equivalence in neighborhoods of their large bifurcation supports is presented, based on such invariants as the configuration and the characteristic set. The realization lemma is proved. ...
Added: May 14, 2026
Taletskii D., / Series arXiv "math". 2026.
A vertex subset of a graph is called a \textit{distance-$k$ independent set} if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal distance-$k$ independent sets among all $n$-vertex trees. It equals~$n$ if $n \leq k ...
Added: May 1, 2026