?
О 5- и 6-листных деревьях, имеющих наибольшее количество паросочетаний
Математические заметки. 2024. Т. 115. № 3. С. 371–384.
Kuznetsov A. P., Sataev I. R., Stankevich N., Chaos 2026 Vol. 36 No. 8 Article 083131
A radio-physical system, namely, a two-mode van der Pol generator, is considered. It is shown that this system demonstrates two types of chaos: with one and two zero Lyapunov exponents. The regions of the second type of chaos are surrounded by bifurcation lines of invariant tori doubling. Quasi-periodic structures of various shapes are embedded within ...
Added: August 30, 2026
Shirokov N. A., Rozenblum G., Israel Journal of Mathematics 2026 P. 1–30
We establish that a generalized H\¨older continuous function on an (m−2)-Ahlfors regular compact set in Rm can be approximated by solutions of an elliptic equation, with the rate of approximation determined by the continuity modulus of the function ...
Added: August 29, 2026
Avdoshin S.M., Patrushev K. A., Proceedings of the Institute for System Programming of the RAS 2026 No. 4 часть 2 P. 245–256
The cardinality-constrained Markowitz problem is NP-hard and traditionally solved with commercial MIQP solvers. Following the 2022 export restrictions that rendered both commercial MIQP software and cloud quantum platforms (IBM Quantum, D-Wave Leap) inaccessible from the Russian Federation, practitioners require open-source alternatives. This paper systematically compares three solver families for the discrete mean-variance problem: two open-source ...
Added: August 27, 2026
Zaikin A., Vlasenko D., Zakharov D. et al., Diagnostics 2026 Vol. 16 No. 17 P. 1–15
Background/Objectives: Synolitic graphs (SGs) were developed for task-based fMRI, where
edge weights encode the discriminative power of pairwise regional features; whether similar
information can be recovered from resting-state data was untested. We benchmarked
SGs for autism spectrum disorder (ASD) classification using the multisite ABIDE-I dataset
(871 subjects: 403 subjects with ASD, 468 typical controls; 17 sites; CC200 atlas). Methods:
Using ...
Added: August 27, 2026
Melnikov I., Pelinovsky E., Nonlinear Dynamics 2026 No. 114 Article 934
Pyramidal solitons (solitons with more than two inflection points) of the generalized Korteweg–de Vries (KdV) equation are investigated. Necessary and sufficient conditions for the existence of such structures are presented. Within the framework of the generalized Gardner equation — the simplest model that admits pyramidal solitons as solutions — it is shown that these solutions ...
Added: August 27, 2026
Тула: Тульский государственный педагогический университет им. Л.Н. Толстого, 2025.
Сборник содержит материалы, представленные на XXIV Международной конференции «Алгебра, теория чисел, дискретная геометрия и многомасштабное моделирование: современные проблемы, приложения и проблемы истории», посвящённой 110-летию со дня рождения академика Юрия Владимировича Линника и 110-летию со дня рождения профессора Андрея Борисовича Шидловского и 80-летию со дня рождения профессора Геннадия Ивановича Архипова. Материалы конференции будут полезны научным работникам, ...
Added: August 27, 2026
Nesterenko A., Чирский В. Г., Матвеев В. Ю., Чебышевский сборник 2026 Т. 27 № 2 С. 118–127
The article presents the results of a practical study of the statistical properties of some sequences that are values of functions of a special type. ...
Added: August 26, 2026
Eduard Sopin, Nazarin A., Begishev V. et al., IEEE Transactions on Vehicular Technology 2026 Vol. 75 No. 6 P. 10995–11007
Aimed at rate-greedy applications having extreme requirements for the data rate at the air interface, 5G New Radio (NR) systems may experience problems when the number of user equipment (UE) in the coverage of the cell increases due to limited capacity of the physical downlink control channel (PDCCH).The aim of this study is to explore ...
Added: August 26, 2026
Джонов А. Т., Avdoshin S. M., Информационные технологии 2026 Т. 32 № 8 С. 421–427
This systematic review presents an analysis of the "Vibe Coding" methodology — a contemporary approach to the iterative software development process using Large Language Models (LLMs). Code generation tools are transforming software development by enabling programmers to formulate tasks and describe the desired behavior of software in natural language, while LLMs generate source code corresponding ...
Added: August 25, 2026
Блудов М. В., Journal of Fixed Point Theory and Applications 2026 No. 28 Article 73
In this paper, we study a construction of homotopy invariants of open or closed covers, where the homotopy class is defined relative to a pair (V, r), with V a finite set of points in and r a point in the interior of their convex hull. We show that the simplicial complex of non-balanced subsets associated with (V, r) has the homotopy ...
Added: August 25, 2026
Melman A., Evsyutin O., Journal of the Franklin Institute 2026 Vol. 363 No. 15 Article 109005
Open access to images creates opportunities for violation of the authors' rights. Digital watermarks can be used to securely publish images online. They are invisibly added into the images before publication and can be extracted at any time to verify ownership. However, achieving a balance between embedding imperceptibility and robustness to image processing operations is ...
Added: August 25, 2026
L.I. Kuzmina, Osipov , Y. V., Kolokoltseva, T. N., Advances in Water Resources 2026 Vol. 213 Article 105335
We study 1D transport of mobilized particles, detached from the solid matrix, in porous media (so-called fines migration). Three types of colloidal-suspension flow models are considered: (i) averaged model for multicomponent colloids with distributed properties; (ii) flow of binary colloids with interacting particles; (iii) discrete system for multicomponent low-concentration colloid. These models account for distributed ...
Added: August 25, 2026
Liudmila I. Kuzmina, Osipov, Y. V., International Journal for Computational Civil and Structural Engineering 2026 Vol. 22 No. 2 P. 138–148
Modeling the transport and sedimentation of small particles of suspensions and colloids in porous rocks is an important problem in subsurface hydromechanics. Particles entrained in fluid are transported and retained in the rock pores. The filtration process is determined by the number and size of pores and is characterized by porosity—the ratio of the void ...
Added: August 25, 2026
L.I.Kuzmina, Osipov Y. V., Mathematical notes, ISSN 0001-4346 2025 Vol. 116 No. 6 P. 1251–1261
We consider the displacement of oil by water with active chemical reagents in porous media. A one-dimensional model of reagent transport and deposition is defined by a hyperbolic system of first-order equations. The purpose of the article is to find the conditions for the existence of a continuous solution with discontinuous boundary and initial conditions. ...
Added: August 25, 2026
IEEE, 2026.
It is with great pleasure that we welcome all the participants of the 12th Conference on Control, Decision and Information Technologies (CoDIT 2026) at the Polytechnic University of Bari – Orabona Street 4, 70125 Bari, Italy, July 13-16, 2026. CoDIT has grown to become one of the largest conferences organized in Europe and in the ...
Added: August 24, 2026
Лукьяненко Д. В., Ragimova A., Мухорина А. et al., European Physical Journal: Special Topics 2026 P. 1–24
Electronic health records (EHRs) contain vast volumes of clinical information that encode complex relationships between diseases. Traditional approaches to the analysis of interrelated or co-occurring diseases have focused on pairwise associations between diagnoses, missing the higher-order structures that characterise multimorbid patients. The present paper offers a narrative review of existing statistical, machine-learning, and artificial intelligence ...
Added: August 20, 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