?
О 5- и 6-листных деревьях, имеющих наибольшее количество паросочетаний
Математические заметки. 2024. Т. 115. № 3. С. 371–384.
Pikalov V., Meshcheryakov V., Kondratev S. et al., Technologies 2026 Vol. 14 No. 1 P. 1–27
This paper presents Aerokinesis, an IoT-based software–hardware system for intuitive gesture-driven control of quadcopter unmanned aerial vehicles (UAVs), developed within the Robot Operating System 2 (ROS2) framework. The proposed system addresses the challenge of providing an accessible human–drone interaction interface for operators in scenarios where traditional remote controllers are impractical or unavailable. The architecture comprises ...
Added: May 19, 2026
Кондратьев С., Никитин Г. Э., Дырченкова Ю. А. et al., Technologies 2026 Vol. 14 No. 1 P. 1–27
This paper presents Aerokinesis, an IoT-based software–hardware system for intuitive gesture-driven control of quadcopter unmanned aerial vehicles (UAVs), developed within the Robot Operating System 2 (ROS2) framework. The proposed system addresses the challenge of providing an accessible human–drone interaction interface for operators in scenarios where traditional remote controllers are impractical or unavailable. The architecture comprises ...
Added: May 19, 2026
Жакупов О. Б., European Journal of Mathematics 2025 Vol. 11 Article 84
We provide examples of smooth three-dimensional Fano complete intersections of degree 2, 4, 6, and 8 that have absolute coregularity 0. Considering the main theorem of Avilov, Loginov, and Przyjalkowski (CNTP 18:506–577, 2024) on the remaining 101 families of smooth Fano threefolds, our result implies that each family of smooth Fano threefolds has an element of absolute ...
Added: May 18, 2026
Springer, 2025.
This book constitutes the refereed proceedings of the 19th International Conference on Parallel Computational Technologies, PCT 2025, held in Moscow, Russia, during April 8–10, 2025.
The 31 full papers included in this volume were carefully reviewed and selected from 122 submissions. These papers were organized under the following topical sections: High Performance Architectures, Tools and Technologies; ...
Added: May 18, 2026
Ronglin Z., Wei L., Jiahong C. et al., Journal of Signal Processing Systems 2026 Vol. 98 P. 1–15
To address the need for lightweight and low-latency protection in massive resource-constrained 5G Internet of Things (IoT) systems, this paper proposes Key-Controlled Modulation Hopping and Constellation Rotation (KMHCR). KMHCR is designed as a physical-layer confidentiality-enhancement mechanism that avoids bit-wise full-payload encryption in the protection pipeline. It uses a shared key derived from channel-reciprocity secret key ...
Added: May 16, 2026
Suvorov N. M., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 3(2) P. 49–66
Data Petri Nets (DPNs) extend classical Petri nets to model processes where data directly influences control-flow, enabling a comprehensive view of system behavior and possibility to detect failure points that could otherwise be hidden. Soundness is a correctness criterion that captures such failure points as deadlocks and livelocks as well as model boundedness and absence ...
Added: May 16, 2026
Lerman L. M., Turaev D. V., Regular and Chaotic Dynamics 2026 Vol. 31 No. 3 P. 349–369
We show that bifurcations of four-dimensional symplectic diffeomorphisms with a quadratic homoclinic tangency to a saddle periodic orbit with real multipliers produce 2-elliptic periodic orbits if the tangency is not partially hyperbolic. We show that a normal form for the rescaled first-return maps near such tangency is given by a four-dimensional symplectic H´enonlike map and study bifurcations of the ...
Added: May 15, 2026
Aleskerov F. T., Yakuba V. I., Khutorskaya O. et al., Springer, 2026.
The book contains new models of bibliometric analysis based on centrality measures in network analysis, pattern analysis and stability analysis. A distinctive feature of these centrality measures is that they account for the parameters of vertices and group influence of vertices to a vertex. This reveals specific groups of publications, authors, terms, journals and affiliations ...
Added: May 15, 2026
Kuptsov P., Panyushev A., Stankevich N., Chaos 2026 Vol. 36 No. 5 Article 053138
We develop a machine-learning approach to reproduce the behavior of two versions of the van der Pol oscillator exhibiting a subcritical Andronov–Hopf bifurcation, with or without a codimension-2 Bautin point. We construct a neural-network model that functions as a recur rent map and train it on short segments of oscillator trajectories. The results show that, ...
Added: May 15, 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
Lebedev V., Journal of Mathematical Analysis and Applications 2026 Vol. 563 No. 2 Article 130787
It is known that for every continuous real-valued
function $f$ on the circle $\mathbb T=\mathbb R/2\pi\mathbb Z$ there exists a
change of variable, i.e., a self-homeomorphism $h$ of $\mathbb T$, such that
the superposition $f\circ h$ is in the Sobolev space $W_2^{1/2}(\mathbb T)$.
We obtain new results on simultaneous improvement of functions by a single
change of variable in relation ...
Added: May 14, 2026
Neal N. X., Weiqing L., Dacheng H. et al., Algorithms 2026 Vol. 19 No. 5 P. 1–22
In the era of data-driven education, educational social networks generate large volumes of high-dimensional and complex-structured data through learner interactions, collaborative activities, and resource-sharing behaviors, posing significant challenges to traditional unsupervised learning methods. Such data often exhibit non-convex distributions, heterogeneity, and noise sensitivity, making conventional clustering approaches insufficient for capturing their intrinsic structural relationships. To ...
Added: May 13, 2026
Blokh A., Oversteegen L., Selinger N. et al., Arnold Mathematical Journal 2025 Vol. 12 No. 1 P. 1–40
We describe a model for the boundary of the connectedness locus of the parameter space of cubic symmetric polynomials. We show that there exists a monotone continuous function from the connectedness locus to the model which is a homeomorphism if the former is locally connected. ...
Added: May 13, 2026
Velichkov B., Nikolova-Koleva I., Slavcheva M., Shumen: INCOMA Ltd, 2025.
The RANLP 2025 Student Research Workshop (RANLPStud’2025) is a special track of the established international conference Recent Advances in Natural Language Processing (RANLP’2025).
The RANLPStud is being organised for the 9th time and this year is running in parallel with the other tracks of the main RANLP 2025 conference. The target of RANLPStud’25 is to be a ...
Added: May 12, 2026
Petrov I., Автоматика и телемеханика 2026 № 6 С. 82–118
Системам связанных агентов и сетевому управлению посвящено большое число отечественных и зарубежных исследований. Исторически, наибольший интерес в теории управления возникал к усредняющим системам и, в частности, к задаче консенсуса. Однако сетевое взаимодействие может характеризоваться более специфическими функциями, отражающими зависимость от действий соседей по сети, что особенно явно проявляется в моделях стратегического взаимодействия на сети, которое ...
Added: May 12, 2026
Ignatov D. I., , in: FCA4AI 2024: The 12th International Workshop "What can FCA do for Artificial Intelligence?", October 19 2024, Santiago de Compostela, SpainVol. 3911.: CEUR Workshop Proceedings, 2024. P. 27–38.
The paper formulates Zarankiewicz problem in terms of formal contexts as follows: What is z(m, n; s, t), the
largest size of the incidence relation of a formal context with m objects and n attributes, for which there is no a
formal concept with the given extent s and t intent sizes and larger? Exact formulas for ...
Added: January 23, 2026
Taletskii D., Дискретный анализ и исследование операций 2023 Т. 30 № 3 С. 111–131
The set of vertices of a graph is called distance-k independent if the distance between any two of its vertices is greater than some integer k ⩾ 1. In this paper we describe n-vertex trees with a given diameter d which have maximum and minimum possible number of distance-k independent sets among all such trees. The ...
Added: June 13, 2023
Taletskii D., Математические заметки 2023 Т. 113 № 4 С. 577–595
The class of trees in which the degree of each vertex does not exceed an integer d is considered. It is shown that, for d = 4, each n-vertex tree in this class contains at most (√2)^n minimum dominating sets (MDS), and the structure of trees containing precisely (√2)^n MDS is described. On the other hand, ...
Added: April 25, 2023
Kuzmin N., Malyshev D., Математический сборник 2023 Т. 214 № 2 С. 143–154
Паросочетанием в графе называется любое множество его попарно несмежных ребер. Количество паросочетаний, называемое также индексом Хосойи, является важным параметром графов, находящим свое применение в математической химии. Ранее была полностью решена задача максимизации индекса Хосойи в деревьях радиуса 2 (=диаметра 4) заданного размера. В настоящей статье рассматривается и полностью решается задача максимизации этого индекса в деревьях ...
Added: December 6, 2022
Taletskii D., Дискретный анализ и исследование операций 2023 Т. 30 № 1 С. 110–129
The minimum total dominating set (MTDS) of a graph is a vertex subset D of minimum cardinality such that every vertex of the graph is adjacent to at least one vertex of D. In this paper we obtain the sharp upper bound for the number of MTDS in the class of n-vertex 2-caterpillars. We also show that ...
Added: November 15, 2022
Taletskii D., Математические заметки 2021 Т. 109 № 2 С. 276–289
Рассматривается задача описания 𝑛-вершинных деревьев диаметра 𝑑, содержащих минимально возможное количество независимых множеств. Эта задача решается для случаев 𝑑 = 6, 𝑛 > 160 и 𝑑 = 7, 𝑛 > 400. ...
Added: November 24, 2020
Taletskii D., Malyshev D., Дискретная математика 2018 Т. 30 № 4 С. 115–133
Для любого n в множестве n-вершинных деревьев, в которых любые два листа не имеют общей смежной вершины, полностью описаны деревья с наименьшим количеством максимальных независимых множеств. ...
Added: December 12, 2018
Taletskii D., Malyshev D., Дискретный анализ и исследование операций 2018 Т. 25 № 2 С. 101–123
Для любых n и d описана структура деревьев с максимально возможным количеством наибольших независимых множеств в классе n-вершинных деревьев, степень каждой вершины которых не превосходит d. Показано, что при всех чётных n экстремальное дерево единственно, а при нечётных n единственности может и не быть, причём при d = 3 для любого нечётного n > 7 ...
Added: May 22, 2018