?
Kolmogorov’s Last Discovery? (Kolmogorov and Algorithmic Statistics)
Theory of Probability and its Applications, USA. 2024. Vol. 68. No. 4. P. 582–606.
Translator: Vereshchagin N.
The definition of descriptional complexity of finite objects suggested by Kolmogorov and other authors in the mid-1960s is now well known. In addition, Kolmogorov pointed out some approaches to a more fine-grained classification of finite objects, such as the resource-bounded complexity (1965), structure function (1974), and the notion of $(\alpha,\beta)$-stochasticity (1981). Later it turned out that these approaches are essentially equivalent in that they define the same curve in different coordinates. In this survey, we try to follow the development of these ideas of Kolmogorov as well as similar ideas suggested independently by other authors.
Publication based on the results of:
Spiridonov V. P., Belousov N. M., Sarkissian G. A., Analysis and Mathematical Physics 2026 Vol. 16 Article 96
Hyperbolic hypergeometric integrals are defined as Barnes-type integrals of products of hyperbolic gamma functions. Their reduction to ordinary hypergeometric functions is well known. We study in detail their degeneration to complex hypergeometric functions. Namely, using uniform bounds on the integrands, we prove that the univariate hyperbolic beta integral and the conical function degenerate to two-dimensional ...
Added: August 4, 2026
Gayfullin S., Kikteva V., Results in Mathematics 2026 Vol. 81 No. 5 Article 146
In this paper we obtain a criterion of flexibility for an affine complexity-zero horospherical variety. This result generalizes previously known results on flexibility of normal horospherical varieties, horospherical varieties with an action of a semisimple group, and non-normal toric varieties. ...
Added: August 3, 2026
Lunts V., Функциональный анализ и его приложения 2026 Т. 60 № 3 С. 127–129
Доказано, что канонические полуортогональные разложения производной категории диаграммной схемы индуцируют аналогичные разложения подкатегории совершенных комплексов. ...
Added: August 3, 2026
Belomestny D., Gasnikov A., Gladin E. et al., Russian Mathematical Surveys 2026 Vol. 81 No. 4(490) P. 3–90
Reinforcement learning (RL) is increasingly grounded in tools from probability, optimization, and operator theory. This survey organizes the mathematical structures that underpin the design and analysis of modern algorithms in RL. We begin from Markov decision processes (MDPs) and the Bellman operators, emphasizing contraction mappings, monotonicity, and fixed-point theory that yield convergence guarantees and rates ...
Added: August 3, 2026
A. Radomskii, Mathematical notes 2026 Vol. 119 No. 6 P. 1136–1147
We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in\mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some restrictions. As applications, for any $t>0$, we obtain an upper bound for the number of $n\in [1,N]$ such that $a_{n}/ \varphi (a_{n})> t$. ...
Added: July 31, 2026
Абызов А. Н., Буутай П. Н., Математика и теоретические компьютерные науки 2026 Т. 4 № 2 С. 4–75
This paper is expository and methodological in nature and is devoted to the development of E.I. Zolotarev’s ideas embedded in his approach to the proof of the quadratic reciprocity law (1872). We consider extensions of Zolotarev’s approach to abstract number rings presented in the work of A. Brunyate and P.L. Clark (2015), and to finite ...
Added: July 30, 2026
Ponomarenko A., / Series Computer Science "arxiv.org". 2025.
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...
Added: July 30, 2026
Mikhaylets E. V., Razorenova A. М., Chernyshev V. L. et al., Scientific Reports 2026 Vol. 16 Article 23560
Meditation offers a naturalistic paradigm for studying introspection, yet the neural dynamics of advanced tantric practices remain largely unexplored. Buddhist Highest Yoga Tantra (BHYT) comprises a sequence of eight dissolution stages culminating in the “clear light” state. We recorded EEG during eyes-closed BHYT meditation performed in monasteries and hermitages (51 sessions from 36 male practitioners; ...
Added: July 29, 2026
Попеленский Ф. Ю., Математический сборник 2026 Т. 217 № 2 С. 108–153
In a recent paper Buchstaber and the author introduced a new structure on the cohomology of Hopf algebras in terms of the Buchstaber spectral sequence (Bss). We fully calculate this structure on the cohomology (known for a long time) of the important Hopf subalgebra A(1) of the classical Steenrod algebra A2.
As part of a demonstration ...
Added: July 28, 2026
Metlov K., Andrei B. Bogatyrëv, Annalen der Physik 2026 Vol. 538 No. 6 Article e70234
Thanks to the recent progress in bulk full three-dimensional nanoscale magnetization distribution imaging, there is a growing
interest to three-dimensional (3D) magnetization textures, promising new high information density spintronic applications.
Compared to 1D domain walls or 2D magnetic vortices/skyrmions, they are a much harder challenge to represent, analyze and
reason about. Here we build analytical representation for such ...
Added: July 28, 2026
Menovshchikov A., Ukhlov A., Rendiconti del Circolo Matematico di Palermo 2026 Vol. 75 Article 91
We consider the nonlinear Neumann eigenvalue problem in outward cuspidal domains with a weighted measure. Using composition operators on Sobolev spaces, we establish embeddings of Sobolev spaces into weighted Lebesgue spaces. These embeddings give the solvability of the Neumann spectral problem in this setting and provide estimates for the corresponding weighted Neumann eigenvalues. ...
Added: July 27, 2026
Menovshchikov A., Journal of Mathematical Sciences 2026 Vol. 298 P. 608–618
We study the set of (p, q)-eigenvalues of the p-Laplace operator with no-flux boundary conditions. We show that this set is closed and that its smallest positive element (the first nontrivial eigenvalue) admits a variational characterization. Moreover, we establish lower bounds for this eigenvalue in cuspidal domains. ...
Added: July 27, 2026
Edward R. Rzaev, Aleksandr Y. Romanov, Andrey M. Sukhov, IEEE Access 2026 Vol. 14 P. 2169–3536
This work presents a hierarchy of strictly local fault-tolerant routing algorithms for 3D mesh networks-on-chip, culminating in an algorithm that combines a live-neighbor selection rule with a bounded single-hop rollback mechanism. The proposed algorithms operate exclusively on immediate neighbor information, maintain O(1) per hop complexity, and require no global topology knowledge, additional virtual channels, or ...
Added: July 23, 2026
Singapore: Springer, 2024.
Included in the following conference series:
INdAM: INdAM Meeting: Kolmogorov Operators and their Applications Workshop
Conference proceedings info: INdAM 2022
Kolmogorov equations are a fundamental bridge between the theory of partial differential equations and that of stochastic differential equations that arise in several research fields.
This volume collects a selection of the talks given at the Cortona meeting by ...
Added: July 17, 2026
Veretennikov A., Pascucci A., Rondelli A., Stochastic Processes and their Applications 2026 Vol. 199 Article 104978
We present existence results for weak solutions to a broad class of degenerate McKean-Vlasov equations with rough coefficients, expanding upon and refining the techniques recently introduced by the third author. Under certain structural conditions, we also establish results concerning both weak and strong well-posedness. ...
Added: July 17, 2026
Veretennikov A., Ляппиева А. А., Теория вероятностей и ее применения 2026 Т. 71 № 2 С. 295–304
Установлен новый результат о сильной единственности для многомерного СДУ с невырожденной диффузией и частично нерегулярным сносом. Его можно рассматривать как комбинированный вариант на темы Ямада и Ватанабэ (1971), Звонкина (1974) и первого автора настоящей статьи (1980). ...
Added: July 17, 2026
Veretennikov A., Нуриева А. И., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2025 Т. 525 С. 24–30
Предложено новое достаточное условие в задаче о центральной предельной теореме в схеме серий для неоднородных цепей Маркова, с возможностью того, что минимум эргодического коэффициента Маркова–Добрушина может быть ближе к нулю, чем в основном условии Добрушина. ...
Added: July 17, 2026
О частных производных модифицированных полиномов Бернштейна–Станку для функций нескольких переменных
Veretennikov A., Мазутский Н. М., Математический сборник 2025 Т. 216 № 7 С. 3–27
Целью работы является доказательство аппроксимации смешанных производных второго порядка для функции нескольких переменных в норме L1 такими же производными модифицированных полиномов Бернштейна–Станку при минимальной возможной регулярности. ...
Added: July 17, 2026
Ахмярова А. Т., Veretennikov A., Теория вероятностей и ее применения 2025 Т. 70 № 2 С. 211–227
В работе предложены новые версии слабого закона больших чисел (ЗБЧ) для слабо зависимых слагаемых (вообще говоря, разнораспределенных) как при наличии математического ожидания каждого из них, так и без такового. Одним из основных условий в первом из трех рассматриваемых случаев, в котором развиваются идеи из статьи Ю. Ш. Чау 1971 г., является равномерная интегрируемость слагаемых по Чезаро в духе работ по ЗБЧ для ...
Added: July 17, 2026
Veretennikov A., Stochastics and Dynamics 2024
A new weak existence result for degenerate multi-dimensional stochastic McKean–Vlasov equation is established under relaxed regularity conditions. ...
Added: July 17, 2026
Ахмярова А. Т., Veretennikov A., Теория вероятностей и ее применения 2024 Т. 69 № 3 С. 427–438
Предложен новый вариант усиленного закона больших чисел для попарно независимых случайных величин. Основная цель — ослабить требование существования математического ожидания каждого из слагаемых. Предположение о попарной независимости также ослаблено. ...
Added: July 17, 2026
Semenov A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2025 Т. 527 № S С. 7–12
The paper proposes a system of definitions for the basic concepts of computability theory that underlie the mathematics of the digital world: algorithm, computability, calculus, object complexity, close to modern undertnding. Hierarchies of the finite and the problem of consistency are considered. ...
Added: December 6, 2025
Vereshchagin N., / Series arXiv "math". 2024.
The fine approach to measure information dependence is based on the total conditional complexity CT(y|x), which is defined as the minimal length of a total program that outputs y on the input x. It is known that the total conditional complexity can be much larger than than the plain conditional complexity. Such strings x, y ...
Added: August 19, 2024
Bauwens B. F., Zimand M., Journal of the ACM 2023 Vol. 70 No. 2 Article 9
In a lossless compression system with target lengths, a compressor 𝒞 maps an integer m and a binary string x to an m-bit code p, and if m is sufficiently large, a decompressor 𝒟 reconstructs x from p. We call a pair (m,x) achievable for (𝒞,𝒟) if this reconstruction is successful. We introduce the notion ...
Added: March 22, 2023