?
О деревьях заданного диаметра с экстремальным количеством k-дистанционных независимых множеств
Дискретный анализ и исследование операций. 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 maximum problem is solved for the case 1 < k < d ⩽ 5. The minimum problem is significantly more simple and is solved for all 1 < k < d < n.
Брычков М. Е., Незнанов А.А., Программирование 2026 № 4 С. 50–66
The matrix profile (MP) quickly became one of the most important time series preprocessing methods when it was introduced in 2016, facilitating the solution of a wide range of time series analysis problems, in particular anomaly and pattern detection problems. The high significance has led to the emergence of various tools for MP calculating, but ...
Added: October 9, 2026
ООО "Издательство Юрайт ", 2026.
The Collection of Olympiad Problems (COP) in Probability Theory and Mathematical Statistics (PTMS) is offered as a teaching aid primarily for university students and faculty as a developmental supplementary resource, expanding the range of problems to be solved in lectures, seminars, and out-of-class independent work with students in various formats, including (as the title suggests) ...
Added: October 9, 2026
Aleskerov F. T., Вайншток А. П., Делахова А. М. et al., Информационные процессы 2026 Т. 26 № 3 С. 895–913
The development and effective management of territorial entities are priority issues for all states, particularly in the context of the digital transformation of public administration. Over the past decade, the integration of information technologies into municipal and regional planning has significantly altered approaches to strategic development, service delivery, and public engagement. This paper describes the ...
Added: October 9, 2026
Kupavskii A., Noskov F., Forum of Mathematics, Sigma 2026 Vol. 14 Article 124
We call a family of $s$ sets $\{F_1, \ldots, F_s\}$ a sunflower with $s$ petals if, for any distinct $i, j \in [s]$, one has $F_i \cap F_j = \cap_{u = 1}^s F_u$. The set $C = \cap_{u = 1}^s F_u$ is called the {\it core} of the sunflower. It is a classical result of ...
Added: October 8, 2026
Flamarion M. V., Pelinovsky E., Chaos, Solitons and Fractals 2026 Vol. 213 No. 2 Article 119245
This article concerns the study of modulational instability in the rotated-modified Gardner–Whitham (rmGW) equation. This model incorporates both quadratic and cubic nonlinearities, similarly to the Gardner equation, while also retaining the fully dispersive character of the Whitham equation together with a large-scale dispersive term analogous to that in the Ostrovsky equation. Using a classical multiple-scale asymptotic expansion, we ...
Added: October 8, 2026
Люксембург А. А., УРСС, 2005.
Изучается возможность автоматизированного построения математических теорий. Рассматривается дедуктивная система, основанная на языке логики предикатов первого порядка, объектами системы являются математические выражения или формулы, которые описывают математические объекты или их свойства. В дедуктивной системе выводятся математические определения и теоремы. Для доказательства теорем используются методы автоматического доказательства. Разработан алгоритм, выводящий часть формул системы. Для решения задачи используется аппарат математической ...
Added: October 7, 2026
Aleskerov F. T., Chaika E., Дерендяев А. Б. et al., Procedia Computer Science 2026 No. 287 P. 590–595
Under conditions of dynamic socio-economic changes, effective planning and decision-making are key factors in ensuring a high quality of life for the population in territories. This paper presents a decision support system for territorial administrations for the development and implementation of sustainable development strategies, using one of the regions of the Russian Federation – the ...
Added: October 7, 2026
Bernardin C., Gonçalves P., Olla S., Mathematical Physics Analysis and Geometry 2024 Vol. 27 No. 7
We consider the macroscopic limit for the space-time density fluctuations in the open symmetric simple exclusion in the quasi-static scaling limit. We prove that the distribution of these fluctuations converge to a gaussian space-time field that is delta correlated in time but with long-range correlations in space. ...
Added: October 6, 2026
Bernardin C., Chhaibi R., Najnudel J. et al., Probability Theory and Related Fields 2026 Vol. 195 P. 1823–1875
We study the celebrated Shiryaev-Wonham filter (Wonham, W.M., in J. Soc. Ind. Appl. Math. 347–369, 1964) in its historical setup, where the hidden Markov jump process has two states. We are interested in the weak noise regime for the observation equation. Interestingly, this becomes a strong noise regime for the filtering equations. Earlier results of ...
Added: October 5, 2026
Ismailov A., Spiridonov V., Успехи математических наук 2026 Т. 81 № 5 С. 183–184
Получена новая формула для цепной дроби Аски–Вильсона в форме отношения двух q-гипер-геометрических рядов. ...
Added: October 5, 2026
Abdulkhaev K., Shirokov D., Advances in Applied Clifford Algebras 2026 Vol. 36 P. 1–21
In this paper, we present explicit formulas for the inverse and determinant in geometric (Clifford) algebras over vector spaces of dimension n = 7. The derivation of these formulas is made possible by generalizing the concept of conjugation to basis conjugation operations. We further develop a general method for constructing such formulas over odd-dimensional spaces ...
Added: October 4, 2026
Kuninets A., IEEE Transactions on Information Theory 2026 P. 1–1
In this work we study the applicability of Quasi-Cyclic Subfield Subcodes of Dual Elliptic (QC-SSDE) codes for integration into code-based cryptographic schemes. Detailed algorithms are provided for constructing parity-check matrices as well as block-circulant parity-check matrices for this family of codes, accompanied by empirical results that enable the construction of QC-SSDE codes with predetermined dimensions. ...
Added: October 3, 2026
Medvedev G., Alexandrov Artem, Physical Review E - Statistical, Nonlinear, and Soft Matter Physics 2026 Vol. 114 Article 044102
Graphons are measurable functions used to describe the asymptotic behavior of convergent graph families. Originally motivated by problems in combinatorics and graph theory, graphons have found numerous applications in the modeling and analysis of dynamical processes on networks. In this work, we use graphons to formulate the Ising model on convergent graph sequences, which include ...
Added: October 2, 2026
Pochinka O., Baranov D., Nozdrinova E., Теоретическая и математическая физика 2026 Т. 229 № 1 С. 3–14
The Birman–Williams problem on describing the planetary link of a fibered knot K in S^3 has been partially solved. Using Nielsen's theory for the classification of periodic surface homeomorphisms and its close relationship with the theory of gradient-like diffeomorphisms, it is proved that the planetary link of the trefoil (the unique periodic fibered knot of genus ...
Added: October 2, 2026
Lubashevsky I., Lubashevskiy V., Physica D: Nonlinear Phenomena 2026 Vol. 498 Article 135441
We develop a novel cloud-function formalism describing the dynamical relationship between sensory-information processing in large-scale brain networks (supraliminal processing) and the content of the mental representation of an observed object. The formalism combines elements of neural field theory for large-scale neural activity with the spatial characteristics of perceived objects and their embedding in the environment ...
Added: October 2, 2026
Zlotnik A., Математические заметки 2026 Т. 120 № 6 С. 1005–1009
Численным методам решения систем газодинамических уравнений посвящена обширная литература. Ранее было разработано и успешно апробировано специальное семейство симметричных по пространству консервативных разностных методов, основанных на предварительной кинетической, точнее, квазигазодинамической (КГД), регуляризации этих уравнений. Актуальной задачей является построение численных методов, которые обладают не только свойством консервативности по массе, импульсу и полной энергии, но и удовлетворяют условиям энтропийной ...
Added: October 1, 2026
Vyugin I. V., Sashadhar D., Algebra and Number Theory 2026 P. 1–10
We study the K-Fibonacci sequence Fp modulo prime p. Cardinalities of sets |Fp+Fp| and |Fp⋅Fp| are estimated. We present the method of estimating doubling constant of some m-dimensional recurrent sets in Fp. ...
Added: October 1, 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
Gurvich V., Krnc M., Vyalyi M., Results in Mathematics 2025 Vol. 80 Article 117
An amoeba is a tree together with instructions how to iteratively grow trees by adding paths of a fixed length . This paper analyses such a growth process. An amoeba is mortal if all versions of the process are finite, and it is immortal if they are all infinite. We obtain some necessary and some ...
Added: August 24, 2025
Kuzmin N., Malyshev D., Математические заметки 2024 Т. 115 № 3 С. 371–384
Паросочетанием графа называется любое множество его ребер, попарно не имеющих общих вершин. Важным параметром графов, находящим свое применение в математической химии, является индекс Хосойи, определяемый как количество их паросочетаний. Ранее рассматривались и были полностью решены задачи максимизации этого индекса для 𝑛-вершинных деревьев c двумя, тремя, четырьмя листьями при любом достаточно большом 𝑛. В этой работе ...
Added: April 15, 2024
Taletskii D., Дискретный анализ и исследование операций 2024 Т. 31 № 1 С. 109–128
The set of graph vertices J_k is called k-dominating independent (k > 1) if its vertices are pairwise adjacent and every vertex not from J_k is adjacent to at least k vertices from J_k. In the presentb paper we obtain new upper bounds for the number of k-dominating independent sets for k > 2 in ...
Added: March 25, 2024
D. S. Taletskii, Sbornik Mathematics 2023 Vol. 214 No. 11 P. 1627–1650
The following conjecture is formulated: if the average vertex degree in a graph is not greater than a positive integer k⩾1, then the number of k-dominating sets in this graph does not exceed the number of its independent sets, and these numbers are equal to each other if and only if the graph is k-regular. This conjecture is proved for k∈{1,2}. ...
Added: March 25, 2024
Qian X., Guan X., Jia J. et al., Journal of Optimization Theory and Applications 2024 Vol. 200 P. 524–554
Given an undirected tree T = (V, E) and a value σ > 0, every edge e ∈ E has a lead time l(e) and a capacity c(e). Let Pst be the unique path connecting s and t. A transmission time of sending σ units data from s to t ∈ V is Q(s, t,σ) ...
Added: January 18, 2024
D. S. Taletskii, Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2023 Vol. 17 No. 3 P. 664–677
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 that have the maximum and minimum possible number of distance-k independent sets among all such ...
Added: November 8, 2023