?
NP-полнота игры “Ханаби” при минимальных параметрах
Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика). 2025. № 527. С. 206–216.
We study the algorithmic complexity of the cooperative card game Hanabi. The feature of Hanabi is that players see each other’s cards but not their own, and exchange information through hints. Even in the model with one player who has full information about the deck, Hanabi remains NP-hard. We found the minimal parameters ofthe game that preserve NP-hardness. If these parameters are further reduced, the game turns out to be solvable in polynomial time.
Смирнов С. В., Миллионщиков Д. В., Уфимский математический журнал 2021 Т. 13 № 2 С. 44–73
В данной работе изучаются характеристические алгебры для систем экспоненциального типа, соответствующих вырожденным матрицам Картана. Эти системы обобщают хорошо известные в теории интегрируемых систем гиперболические уравнения синус-Гордон и Цицейки. Для таких систем, соответствующих матрицам Картана ранга 2, характеристические алгебры описаны явно в терминах образующих и соотношений, и доказано, что они имеют линейный рост. Исследуется связь между ...
Added: September 11, 2026
Смирнов С. В., Glasgow Mathematical Journal 2026 Vol. 68 No. 2 P. 299–316
In the second half of the 19th century Darboux obtained determinant formulae that provide the general solution for a linear hyperbolic second order PDE with finite Laplace series. These formulae played an important role in his study of the theory of surfaces and, in particular, in the theory of conjugate nets. During the last three ...
Added: September 11, 2026
Смирнов С. В., Journal of Physics A: Mathematical and Theoretical 2023 Vol. 56 No. 26 Article 265204
There are different methods of discretizing integrable systems. We consider semi-discrete analog of two-dimensional Toda lattices associated to the Cartan matrices of simple Lie algebras that was proposed by Habibullin in 2011. This discretization is based on the notion of Darboux integrability. Generalized Toda lattices are known to be Darboux integrable in the continuous case ...
Added: September 11, 2026
Enatskaya N., Труды Карельского научного центра РАН. Серия 10: Математическое моделирование и информационные технологии 2026 № 6 С. 132–138
In schemes S for placing r particles in n distinguishable cells, their placement in selected m cells – schemes S∗ is studied, for which the analysis is carried out by a new enumerative method (EM) in extended areas of enumerative combinatorics: finding the number of outcomes and, based on the construction of a model of ...
Added: September 11, 2026
Enatskaya N., Труды Карельского научного центра РАН. Серия 10: Математическое моделирование и информационные технологии 2026 № 6 С. 139–147
The class of particle cell arrangements under consideration is characterized by the introduction of an upper limit on the filling levels of the cells, which must be achieved in at least one cell of each outcome of each arrangement. The circuits are distinguished by the paired qualities of their constituent elements (cells and particles) according ...
Added: September 11, 2026
Podinovskiy V. V., Нелюбин А. П., Автоматика и телемеханика 2026 № 8 С. 110–123
Для многокритериальных задач принятия решений по аналогии с качественной вероятностью введены понятия полной и частичной качественной важности как бинарных отношений, обладающих постулируемыми
свойствами. Предложено новое определение отношения нестрогого предпочтения на множестве вариантов решений, порождаемое качественной
важностью. Исследованы его свойства. Указаны аналитические правила,
позволяющие попарно сравнивать варианты по предпочтительности. Проведено сравнение новых отношений предпочтения с разработанными ранее для задач, ...
Added: September 9, 2026
Podinovskiy V. V., Нелюбин А. П., Автоматика и телемеханика 2026 № 7 С. 113–126
Рассматриваются задачи принятия решений, когда предпочтения оцениваются в порядковой шкале, а возможности реализации значений
неопределенного фактора описываются качественной вероятностью (полной или только частичной). Вводятся определения отношений предпочтения и безразличий на множестве стратегий. Предлагаются простые
решающие правила, позволяющие сравнивать стратегии по предпочтительности, и приводятся иллюстративные примеры. ...
Added: September 9, 2026
Chemical Papers 2026
Benzenoid hydrocarbons are structurally regular aromatic compounds, which makes them well suited for quantitative structure–property relationship (QSPR) studies. This study presents a QSPR analysis of nineteen benzenoid hydrocarbon species using degree-based topological co-indices. We developed a Python program to compute eleven degree-based topological co-indices from molecular graphs and evaluated their ability to explain variations in ...
Added: September 8, 2026
Glutsyuk A., / Series arXiv "math". 2026.
B.Josephson (Nobel Prize, 1973) predicted a tunnelling effect for a system of two superconductors separated by a narrow dielectric (such a system is called Josephson junction): existence of a supercurrent through it and equations governing it. The overdamped Josephson junction is modeled by the family of differential equations on the 2-torus, dθdτ=1ω(cosθ+B+Acosτ), which is known as ...
Added: September 8, 2026
Glutsyuk A., / Series arXiv "math". 2026.
A planar dual billiard is a planar curve γ equipped with a family (σP)|P∈γ of projective involutions of the projective lines LP tangent to γ at P that fix P. A dual billiard is called rationally integrable, if there exists a rational function R(x,y) of two variables (called first integral) whose restriction to each tangent ...
Added: September 8, 2026
Alexandrov A., Glutsyuk A., Journal of Differential Equations 2026 Vol. 465 Article 114178
The overdamped Josephson junction in superconductivity theory can be modeled by the family of dynamical systems on the torus, which is known as the RSJ model. This family admits an equivalent description by a family of second-order differential equations: special double confluent Heun equations. In the present paper, we construct two new families of dynamical systems on ...
Added: September 8, 2026
Glutsyuk A., Inventiones Mathematicae 2026 Vol. 245 P. 977–1058
A caustic of a strictly convex planar bounded billiard is a smooth curve whose tangent lines are reflected from the billiard boundary to its tangent lines. The famous Birkhoff Conjecture, studied by many mathematicians, states that if the billiard boundary has an inner neighborhood foliated by closed caustics, then it is an ellipse. In the paper we study ...
Added: September 8, 2026
Prikhodko Artem, Kubrak D., Compositio Mathematica 2026 Vol. 162 No. 6 P. 1377–1438
In this follow-up paper we show that smooth Hodge-proper stacks over O𝐾 are ℚ𝑝-locally acyclic: namely the natural map between étale ℚ𝑝-cohomology of the algebraic and Raynaud generic fibers is an equivalence. This establishes the ℚ𝑝-case of general conjectures made in D. Kubrak and A. Prikhodko [p-adic Hodge theory for Artin stacks, Mem. Amer. Math. ...
Added: September 7, 2026
Ismailov A., Constructive Approximation 2026
The measure of the positivity set {x ∈ [0; 2π] | f (x) > 0} of a trigonometric polynomial f is bounded from below by the Motzkin density.
We generalize the bound to polynomials in several variables and almost periodic functions.
We then use these generalizations to extend known results on Taikov’s problem. ...
Added: September 7, 2026
Kelbert M., Statistics 2026 Vol. 60
We present variational representations for the weighted divergencies
and exponential error function, and discuss implications for the
statistical inference and entropic optimal transport. ...
Added: September 7, 2026
Kucheryavyy P., Математические заметки 2026 Т. 2026 № 120 С. 380–401
В работе изучаются перестановки, возникающие при упорядочивании по возрастанию дробных долей произведений элементов фиксированной целочисленной последовательности на вещественный параметр. Исследуется количество различных перестановок, которые можно получить таким образом при изменении этого параметра от нуля до единицы. ...
Added: September 7, 2026
Осипов Д.В., Математический сборник 2026 Т. 217 № 9 С. 130–146
Изучаются законы взаимности, связанные с комплексными линейными расслоениями на расслоениях на ориентируемые окружности. В частности, доказывается следующий закон взаимности. Пусть B – комплексное многообразие и πi:Mi→B – расслоение на ориентируемые окружности, где индекс i пробегает конечное множество. Пусть Li и Ni – комплексные линейные расслоения на каждом многообразии Mi. Закон взаимности утверждает, что сумма всех элементов (πi)∗(c1(Li)∪c1(Ni)), где (πi)∗ – ...
Added: September 3, 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
Kazimirov D., Vitalii Gulevskii, Kroshnin A. et al., Mathematics 2026 Article 1136
The Hough transform (HT) is widely used in computer vision, tomography, and neural networks. Numerous algorithms for HT computation have been proposed, making their systematic comparison essential. However, existing comparative methodologies are either non-universal and limited to certain HT formulations, or task-oriented, relying on application-specific criteria that do not fully capture algorithmic properties. This paper ...
Added: May 28, 2026
Dudakov S., Карлов Б. Н., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2025 Т. 524 № 1 С. 11–18
In this paper we study the problem of total derivability in context-free, noncontracting, and context-sensitive grammars. Given a grammar and a terminal word, one has to determine whether there exists a derivation of this word which uses each production no less than a given number of times. It is proved that the problem of total ...
Added: March 18, 2026
Ivanashev Y., , in: 19th Annual Conference, TAMC 2025, Jinan, China, September 19–21, 2025, Proceedings. Theory and Applications of Models of Computation. Lecture Notes in Computer Science (LNCS, volume 16084)Vol. 16084.: Springer, 2026. P. 15–24.
The class TotP consists of functions that count the number of all paths of a nondeterministic polynomial-time Turing machine. In this paper, we give a predicate based definition of TotP, analogous to a standard definition of #P. From a new characterization of TotP it follows that many well known #P problems belong to TotP, and ...
Added: January 20, 2026
Springer, 2026.
This book constitutes the proceedings of the 19th Annual Conference on Theory and Applications of Models of Computation, TAMC 2025, which was held in Jinan, China, during September 19–21, 2025. ...
Added: January 20, 2026
Odintsov S., Speranski S. O., Logic and Logical Philosophy 2012 Vol. 21 No. 3 P. 209–228
The present paper is devoted to computational aspects of propositional inconsistency-adaptive logics. In particular, we prove (relativized versions of) some principal results on computational complexity of derivability in such logics, namely in cases of CLuN-r and CLuN-m , i.e., CLuN supplied with the reliability strategy and the minimal abnormality strategy, respectively. ...
Added: December 27, 2025
Speranski S. O., Studia Logica 2013 Vol. 101 No. 6 P. 1237–1262
In a rather general setting, we prove a number of basic theorems concerning computational complexity of derivability in adaptive logics. For that setting, the so-called standard format of adaptive logics is suitably adopted, and the corresponding completeness results are established in a very uniform way. ...
Added: December 27, 2025