?
О базовых математических определениях цифровых технологий и искусственного интеллекта
Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика). 2025. Т. 527. № S. С. 7–12.
Semenov A.
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.
Keywords: теоретическая информатикаколмогоровская сложностьKolmogorov complexitycomputabilityвычислимостьTheoretical Computer Sciencemathematical foundations of artificial intelligencedefinition of algorithmdefinition of calculushierarchies of the finiteconsistency of mathematicsматематические основания искусственного интеллектаопределение алгоритмаопределение исчисленияиерархии конечностинепротиворечивость математики
Khodadoust J., Kulikova S., Khodadoust F., Biomedical Signal Processing and Control 2027 Vol. 129 P. 111284–111284
Acute ischemic stroke (AIS) analysis from two-dimensional (2D) clinical imaging is hindered by uncontrolled slice tilt and geometric inconsistencies that violate the assumptions of pose-agnostic deep learning (DL) models. This paper proposes a unified geometry-aware, frequency-domain framework for tilted slice localization and ischemic stroke segmentation that explicitly decouples pose estimation from lesion analysis. The method ...
Added: September 2, 2026
IEEE, 2026.
On behalf of the Organizing Committee, it is my great pleasure to extend a warm
welcome to all participants of the Fourth International IEEE Conference on
Distributed Computing and High-Performance Computing (DCHPC 2026), held
in Tehran from May 10–11, 2026. This conference is jointly organized by the
School of Computer Science at the Institute for Research in Fundamental
Sciences (IPM) ...
Added: September 2, 2026
Basalaev A., Rarovskii A., Journal of Singularities 2026 Vol. 30 P. 61–80
Saito theory associates to an isolated singularity rich structure that plays an important role in mirror symmetry. In this note we construct Saito theory for A and D type Landau-Ginzburg orbifolds. Namely, for the pairs (f,G), where f defines an isolated singularity of A and D type and G is a group of symmetries of ...
Added: September 1, 2026
Rybakov M., Shkatov D., Journal of Logic and Computation 2026 Vol. 36 No. 6 Article exag026
We prove Pi-1-1-hardness, and thus lack of recursive axiomatizability, of constant-domain modal predicate logics defined by a class of Dedekind complete linear Kripke frames containing a frame with an infinitely increasing chain of worlds. The result holds even for the language with one unary predicate letter, one propositional letter, and two individual variables. ...
Added: September 1, 2026
Селянин Ф. И., Moscow Mathematical Journal 2026 Vol. 26 No. 2 P. 167–187
Minkowski mixed volume of n subpolytopes D1,…,Dn of a polytope P⊂Rn clearly does not exceed the normalized volume n!Vol(P). Equality holds if and only if the subpolytopes are interlaced, i.e., each proper face F⊊P intersects at least dim(F)+1 of the polytopes Di. Efficiently computing mixed volumes for more general collections of subpolytopes is crucial for estimating the complexity of numerically solving polynomial systems.
Motivated by relaxing the bound dim(F)+1 to dim(F), we ...
Added: August 31, 2026
Kazaryan M., Dunin-Barkowski P., Bychkov B. et al., International Mathematics Research Notices 2026 Vol. 14 Article rnag146
We prove a recent conjecture of the fourth named author with P. Norbury that states a system of universal polynomial relations among the kappa classes on the moduli spaces of algebraic curves. The proof involves localization and materialization analysis of the spin Gromov–Witten theory of the projective line and is dictated by Z 2 -equivariant ...
Added: August 31, 2026
Kazaryan M., Dunin-Barkowski P., Bychkov B. et al., Communications in Mathematical Physics 2026 Vol. 407 No. 69
We prove that for any initial data on a genus zero spectral curve the cor responding correlation differentials of topological recursion are KP integrable. As an application we prove KP integrability of partition functions associated via ELSV-type formulas to the r-th roots of the twisted powers of the log canonical bundles ...
Added: August 31, 2026
Gromov V., Переслегин С. Б., Переслегина Е. Б. et al., СПб.: Полакс, 2026.
Механизм происходящих в мире изменений носит эволюционный, а не экологический характер. Иначе говоря, Человечество столкнулось с кризисом развития, который имеет три независимые составляющие: кризис индустриального общества (фазовый кризис), кризис научного мышления (эпистемный кризис) и кризис формата существования разума (социосистемный кризис). Доклад посвящён аспектам этого триединого кризиса и возможным путям его преодоления, не сводящимся к первичному ...
Added: August 31, 2026
Devyatov R. A., Mathematical notes 2026 Vol. 119 No. 3 P. 782–786
Let G/B be a flag variety over ℂ, where G is a simple algebraic group with a simply laced Dynkin diagram, and B is a Borel subgroup. We say that the product of classes of Schubert divisors in the Chow ring is multiplicity free if it is possible to multiply it by a Schubert class ...
Added: August 30, 2026
Bayer A., Kuznetsov A., Macrì E., Journal fuer die reine und angewandte Mathematik 2026 Vol. 2026 No. 836 P. 111–162
We give a self-contained and simplified proof of Mukai’s classification of prime Fano threefolds of index 1 and genus g ≥ 6 with at most factorial terminal singularities, and of its extension to higher dimension. ...
Added: August 30, 2026
Bayer A., Kuznetsov A., Macrì E., Compositio Mathematica 2026 Vol. 162 No. 1 P. 59–99
We give a proof of Mukai’s theorem on the existence of certain exceptional vector bundles on prime Fano threefolds. To our knowledge this is the first complete proof in the literature. The result is essential for Mukai’s biregular classification of prime Fano threefolds, and for the existence of semiorthogonal decompositions in their derived categories. Our ...
Added: August 30, 2026
Guseva L., Novikov A., Advances in Mathematics 2026 Vol. 503 Article 111211
We prove that the Kuznetsov–Polishchuk exceptional collections on rational homogeneous spaces of the symplectic groups Sp(2n,C) are full and consist of vector bundles. To achieve this, we construct several classes of complexes, which we call generalized staircase complexes, symplectic staircase complexes and secondary staircase complexes — each of which may be of independent interest. ...
Added: August 30, 2026
Polishchuk A., Rains E., Journal of the Institute of Mathematics of Jussieu 2026 Vol. 25 No. 1 P. 339–373
We prove that for every relatively prime pair of integers (d,r) with r>0, there exists an exceptional pair (O,V) on any del Pezzo surface of degree 4, such that V is a bundle of rank r and degree d. As an application, we prove that every Feigin-Odesskii Poisson bracket on a projective space can be ...
Added: August 30, 2026
Kazhdan D., Polishchuk A., Pure and Applied Mathematics Quarterly 2026 Vol. 22 No. 3 P. 1115–1166
We continue the study of automorphic functions associated with a curve C over the ring k[ε]/(ε²), where k is a finite field, begun in arXiv:2303.16259. Namely, we study an example of theta-lifting in this framework and show that it can be understood in terms of the orbit decomposition of the space of automorphic functions S(SL₂(F)\SL₂(A_C)) ...
Added: August 30, 2026
Speranski S. O., Вестник Новосибирского государственного университета. Серия: Математика, механика, информатика 2011 Т. 11 № 4 С. 78–93
В настоящей статье изучаются вычислительные аспекты формального требования максимальной специфичности, накладываемого на правила в языке пропозициональной классической логики, когда над этим языком задана вычислимая рационально-значная вероятностная мера. Доказана неразрешимость ряда общих проблем по обнаружению максимально специфичных правил и вероятностных мер, для которых совокупность всех специфичных правил вычислима; установлена разрешимость множества максимально специфичных правил при неких ...
Added: December 27, 2025
Semenov A., Shen A., Vereshchagin N., Theory of Probability and its Applications, USA 2024 Vol. 68 No. 4 P. 582–606
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 ...
Added: January 16, 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
Bauwens B. F., Gács P., Romashchenko A. et al., Computability 2022 Vol. 11 No. 3-4 P. 165–185
Finding all linear inequalities for entropies remains an important open question in information theory. For a long time the only known inequalities for entropies of tuples of random variables were Shannon (submodularity) inequalities. Only in 1998 Zhang and Yeung 1998 found the first inequality that cannot be represented as a convex combination of Shannon inequalities, and ...
Added: December 23, 2022
Vereshchagin N., Theoretical Computer Science 2023 Vol. 940 P. 108–122
We consider the network consisting of three nodes 1, 2, 3 connected by two open channels
1 → 2 and 1 → 3. The information present in the node 1 consists of four strings x , y , z , w.
The nodes 2, 3 know x , w and need to know y , z, respectively. ...
Added: December 19, 2022
Артемов С. Н., Барздинь Я. М., Бокуть Л. А. et al., Успехи математических наук 2022 Т. 77 № 1(463) С. 191–195
Борис Абрамович Трахтенброт (20.02.1921– 19.09.2016), которому 20 февраля 2021 г. исполнилось бы сто лет, – один из создателей теоретических основ информатики, или Theoretical Computer Science, широко признанный и в СССР, и в мире. Его научная биография интересна также и в гуманистическом, и в историческом аспектах. ...
Added: February 13, 2022
Switzerland: Springer, 2021.
This book constitutes the refereed proceedings of the 12th International Conference on Optimization and Applications, OPTIMA 2021, held in Petrovac, Montenegro, in September-October 2021.
The 22 full and 3 short papers presented were carefully reviewed and selected from 63 submissions. The papers are organized into the following topical sub-headings: mathematical programming, global optimization, discrete and combinatorial ...
Added: November 4, 2021
Milovanov A., , in: Computer Science – Theory and Applications: 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings.: Springer, 2021. Ch. 17 P. 283–295.
We combine Solomonoff’s approach to universal prediction with algorithmic statistics and suggest to use the computable measure that provides the best “explanation” for the observed data (in the sense of algorithmic statistics) for prediction. In this way we keep the expected sum of squares of prediction errors bounded (as it was for the Solomonoff’s predictor) ...
Added: August 11, 2021
Cham: Springer, 2021.
This book constitutes the proceedings of the 20th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2021, held in Irkutsk, Russia, in July 2021.
The 29 full papers and 1 short paper presented in this volume were carefully reviewed and selected from 102 submissions. Additionally, 2 full invited papers are presented in the volume. ...
Added: July 8, 2021