?
A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs
Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций"). 2023. Vol. 17. No. 4. P. 791–801.
Malyshev D., Duginov O. I.
For a given graph, the edge-coloring problem is to minimize the number of colors sufficient to color all the graph edges so that any adjacent edges receive different colors. For all classes defined by sets of forbidden subgraphs, each with 7 edges, the complexity status of this problem is known. In this paper, we obtain a similar result for all sets of 8-edge prohibitions.
Zykov S. V., Ермаков С. Р., Современные наукоемкие технологии 2026 № 9 С. 43–53
При федеративном обучении с неоднородными клиентскими данными и переменными задержками запоздавшие обновления могут ухудшать качество модели, а обмен параметрами с глобальным сервером увеличивает сетевую нагрузку. Целью исследования является разработка и теоретико-экспериментальное обоснование метода и алгоритмов адаптивного федеративного обучения с учетом распределенного запаздывания клиентских обновлений. Для обоснования разрабатываемых решений использованы событийная и непрерывная модели градиентных обновлений, ...
Added: October 11, 2026
Брычков М. Е., Незнанов А.А., Программирование 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
Stepanyants V., Andrey V. Fizulin, Chibirov A. et al., FUTURE TRANSPORTATION 2026 Vol. 6 No. 5 Article 225
Reliable Vehicle-to-Everything (V2X) evaluation requires propagation models that represent terrain and multilevel infrastructure. Most integrated vehicular simulators still rely on planar models, but the magnitude of the resulting bias is unclear. This study quantitatively compares flattened two-dimensional (2D) and terrain-aware three-dimensional (3D) variants of three scenarios using identical Sionna RT settings. The pipeline combines OpenStreetMap ...
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
Groshev Maksim, Rybakov Petr, Teterin N. et al., Sensors 2026 Article 6171
Manual assessment of soybean yield components, such as pod number, is laborious, time-consuming, and subjective. Existing computer-vision approaches based on object detection or instance segmentation perform poorly on close-range RGB imagery of soybean canopies due to severe occlusions, ambiguous plant boundaries, and the high cost of bounding-box annotation. To address these challenges, we propose a ...
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
Томск: Издательство Томского государственного университета, 2026.
Материалы сборника Шестнадцатой Международной конференции «Новые информационные
технологии в исследовании сложных структур» (Москва, 21–25 сентября 2026 г.) ориентированы на
широкий круг специалистов, работающих на стыке теории информации, системного анализа и
прикладных предметных областей. В издание вошли результаты исследований, посвящённые
моделированию дискретных и стохастических структур управления и связи, разработке
высокопроизводительных вычислительных и телекоммуникационных систем, а также вопросам
цифровой трансформации образования, архитектурно-градостроительного проектирования,
экологического ...
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
Kirill V. Kaymakov, Dmitry S. Malyshev, Optimization Letters 2024 Vol. 18 P. 1273–1283
For given edge-capacitated connected graph and two its vertices s and t, the bottleneck (or max min ) path problem is to find the maximum value of path-minimum edge capacities among all paths, connecting s and t. It can be generalized by finding the bottleneck values between s and all possible t. These problems arise ...
Added: April 18, 2024
Gerasimova O., Makarov I., Severin N., IEEE Access 2023 Vol. 11 P. 88074–88086
The problem of query answering over incomplete attributed graph data is a challenging field of database management systems and artificial intelligence. When there are rules on data structure expressed in the form of the ontology, the theoretical complexity of finding exact solution satisfying ontology constraints increases. Logic-based methods use theoretical constructions to obtain efficient rewritings ...
Added: January 5, 2024
Sergei Valentinovich Fedorenko, IEEE Access 2023 Vol. 11 P. 62771–62779
The novel methods for binary discrete Fourier transform (DFT) computation over the finite field have been proposed. The methods are based on a binary trace calculation over the finite field and use the cyclotomic DFT. The direct DFT computational complexity has been reduced due to using the binary trace function over the finite field and ...
Added: July 19, 2023
Complexity function and complexity of validity of modal and superintuitionistic propositional logics
Rybakov M., Shkatov D., Journal of Logic and Computation 2023 Vol. 33 No. 7 P. 1566–1595
We consider the relationship between the algorithmic properties of the validity problem for a modal or superintuitionistic propositional logic and the size of the smallest Kripke countermodels for non-theorems of the logic. We establish the existence, for every degree of unsolvability, of a propositional logic whose validity problem belongs to the degree and whose every ...
Added: January 6, 2023
Malyshev D., Duginov O. I., Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2022 Vol. 16 P. 276–291
The edge-coloring problem is to minimize the number of colors sufficient to color all the edges of a given graph so that any adjacent edges receive distinct colors. The complexity status of this problem is known for all the classes defined by the sets of forbidden subgraphs with 7 edges each. In this paper, we ...
Added: December 31, 2022
G. S. Dakhno, D. S. Malyshev, Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2023 Vol. 17 No. 1 P. 25–31
A hereditary class is a set of simple graphs closed under deletion of vertices; every such class is defined by the set of its minimal forbidden induced subgraphs. If this set is finite, then the class is said to be finitely defined. The concept of a boundary class is a useful tool for the analysis ...
Added: December 6, 2022
Kochergin V., Moscow University Mathematics Bulletin 2022 Vol. 77 No. 3 P. 113–119
Abstract: The computational complexity of the element (Formula presented.) of the Abelian group (Formula presented.) (it is supposed that kii for all i) and the computational complexity of the term (Formula presented.) are compared in the paper. The computational complexity means the minimal possible number of multiplication operations, and all the results of intermediate multiplications ...
Added: October 29, 2022
Rybakov M., Shkatov D., Theoretical Computer Science 2022 Vol. 925 P. 45–60
We prove that branching-time temporal logics CTL and CTL* are polynomial-time embeddable into their single-variable fragments. It follows that satisfiability for CTL and CTL*, and therefore also for alternating-time temporal logics ATL and ATL*, in languages with one propositional variable is as algorithmically hard as satisfiability for the full logic: EXPTIME-complete for CTL and ATL, and 2EXPTIME-complete for CTL* and ATL*. We discuss applicability of the technique used in the proofs to other ...
Added: May 12, 2022
Malyshev D. S., Приставченко О. В., Optimization Letters 2022 Vol. 16 P. 1403–1409
The vertex 3-colourability problem is to decide whether the vertex set of a given graph
can be split into three subsets of pairwise non-adjacent vertices. This problem is known
to be NP-complete in a certain class of graphs, defined by an explicit description of
allowed 5-vertex induced subgraphs in them. In the present paper, we improve this
result by ...
Added: February 25, 2022
Rubtsov A. A., Vyalyi M., Information and Computation 2021 Vol. 281 Article 104797
We consider a computational model which is known as set automata. The set automata are one-way finite automata with additional storage-the set. There are two kinds of set automata-deterministic (DSA's) and nondeterministic (NSA's). The model was introduced by Kutrib, Malcher, Wendlandt in 2014. It was shown that DSA-recognizable languages look similar to DCFL's and NSA-recognizable ...
Added: February 2, 2022