?
О 5- и 6-листных деревьях, имеющих наибольшее количество паросочетаний
Математические заметки. 2024. Т. 115. № 3. С. 371–384.
Yu Z., Wang J., Wang Z. et al., Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 2026 Vol. 384 P. 1–16
The integration of data-driven and knowledge-driven approaches in generative geospatial modelling (GGM) is often hindered by their mathematical incompatibilities. Here, we propose a geometric algebra (GA)-based framework that employs a unified multi-vector representation to fuse heterogeneous data and diverse knowledge. The framework facilitates structured reasoning and hypothesis generation through a task-adaptable, five-stage cycle: representation, reasoning, ...
Added: August 13, 2026
Cham: Springer, 2026.
This book constitutes the proceedings of the 10th International Workshop Empowering Novel Geometric Algebra for Graphics and Engineering, ENGAGE 2025, held in conjunction with Computer Graphics International conference, CGI 2025, in Hong Kong, China, on July 14, 2025.
The 14 full papers included in this volume were carefully reviewed and selected from 16 submissions. The papers ...
Added: August 13, 2026
Ratnikov F., European Physical Journal: Special Topics 2026 P. 1–10
EEG recordings are often affected by the loss or corruption of individual channels due to electrode detachment, poor scalp contact, or external interference. Such channels must be accurately reconstructed before further analysis. In this study, we investigate Next-Generation Reservoir Computing (NG-RC) as a data-driven approach for reconstructing corrupted EEG channels and compare its performance with ...
Added: August 12, 2026
Speranski S. O., Математические заметки 2026 Т. 120 № 3 С. 470–483
We show that, in terms of closure ordinals, many infinitary calculi for ‘first-order’ logics of probability (i.e., for languages similar to those in [Abadi & Halpern 1994]) are as hard as possible: the corresponding closure ordinals coincide with the least non-constructive ordinal, denoted by $\omega_1^{\mathrm{CK}}$. ...
Added: August 12, 2026
Minets M., Krasnozhenov G., Trofimova E. et al., PeerJ Computer Science 2026 Vol. 12 Article e4063
This article presents CAD2TechSpec, a novel framework for automating design processes within computer-aided design (CAD) systems by leveraging multimodal large language models (LLMs). The framework enables the analysis and generation of detailed design specifications, including the automated creation of machining process plans. Our system architecture combines 3D model rendering, dimensionality reduction techniques, and the capabilities ...
Added: August 12, 2026
Мизинов П. В., Journal of Computer Virology and Hacking Techniques 2023 No. 20 P. 383–396
Biometric vein recognition systems are vulnerable to presentation attacks. Traditionally, researchers have used a near-infrared (NIR) drawing of the user’s vascular bed to create a presentation attack instrument (PAI). This paper investigates the feasibility of using free software to capture a venous pattern of the hand without NIR under normal lighting conditions and to create ...
Added: August 11, 2026
Ali S., Bocharnikov V., Ratnikov F. et al., Sensors 2026 Vol. 26 No. 16 Article 5024
Large distributed sensor arrays require repeated recalibration as radiation damage, material aging, gain variation, and readout drift alter channel responses. We studied a high-granularity calorimeter as a large sensor array and addressed unsupervised recalibration from two unpaired datasets: a nominal reference response and an aged response with attenuated cell-wise signals. Aging was modeled by a ...
Added: August 11, 2026
Trubochkina N. K., М.: Издательство «Юрайт», 2026.
This textbook is designed to develop students' holistic understanding of modern production processes and methods for their analysis and management using machine learning technologies. In the context of the fourth industrial revolution, where traditional engineering disciplines are inextricably intertwined with intelligent data processing methods, there is a growing need for specialists capable of integrating knowledge ...
Added: August 8, 2026
Kulev Y., Maksaev A., Promyslov V., Linear Algebra and its Applications 2026 Vol. 730 P. 51–72
The notion of λ-th upper scrambling index was introduced by Huang and Liu in 2010, as a generalization of a notion considered by Akelbek and Kirkland in 2009. For a primitive digraph D, it is defined as the smallest positive integer k such that for every λ vertices of D there exist directed paths of lengths k from these vertices to a common vertex. This ...
Added: August 7, 2026
Kanunnikov A., Promyslov V., Vassilieva E., Electronic Journal of Combinatorics 2024 Vol. 31 No. 3 Article P3.6
Introduced by Goulden and Jackson in their 1996 paper, the matchings-Jack conjecture and the hypermap-Jack conjecture (also known as the b-conjecture) are two major open questions relating Jack symmetric functions, the representation theory of the symmetric groups and combinatorial maps. They show that the coefficients in the power sum expansion of some Cauchy sum for ...
Added: August 7, 2026
Фирсанова В. И., ACM, 2026.
The inclusion of autistic people can be augmented by a mobile app that provides information without a human mediator making information perception more liberating for people in the spectrum. This paper is an overview of a doctoral work dedicated to the development of a web-based mobile tool for supporting the inclusion of people on the ...
Added: August 4, 2026
Фирсанова В. И., Хлусова Я. К., CEUR Workshop Proceedings, 2025.
Knowledge graphs are widely used in Retrieval Augmented Generation (RAG) and Explainable AI (XAI), since they can illustrate semantic relationships generated by Large Language Models (LLMs). Recent studies focus on generating knowledge graphs from unstructured data to improve RAG performance; however, they do not explain the underlying graph structure. The analysis of synthetic graphs behind ...
Added: August 4, 2026
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
Chepovskiy A., М.: Мастерская Печати Идей, 2026.
The textbook presents methods and algoгithms for automatic analysis
of соrроrа of texts in natural languages. It is intended fоr sfudenБ of
methods of processing texts in паtчrаl languages and creating training
arays of texts.
Fоr students, graduate students and researchers studying methods
of computational linguistics and word processing. ...
Added: August 1, 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
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