?
Дробные раскраски случайных гиперграфов
Успехи математических наук. 2023. Т. 78. № 6 (474). С. 183–184.
Zakharov P., Shabanov D. A.
We obtain very accurate estimates for the threshold probability of fractional (4:2)-colorability property in a random k-uniform hypergraph in the binomial model H(n,k,p).
German O., Illarionov A., Известия РАН. Серия математическая 2026 Т. 90 № 3 С. 3–18
Пусть симплекс с целочисленными вершинами - содержащий ровно одну целочисленную точку, отличную от своих вершин. В работе доказывается, что если точка находится во внутренности симплекса или в относительной внутренности некоторой гиперграни симплекса, то объем симплекса ограничен величиной, зависящей только от размерности, в противном случае объем симплекса может быть сколь угодно большим. Этот результат применяется для вывода асимптотической формулы для среднего числа вершин полиэдров ...
Added: June 29, 2026
Ivchenko A., Nigmatullin R. R., Dorokhin S. V., Mathematics 2026 Vol. 9 No. 4 Article 381
n this paper, we focus on the generalization of the Hurst empirical law and suggest a set of reduced parameters for quantitative description of long-time series. These series are usually considered as a specific response of a complex system (economic, geophysical, electromagnetic and other systems), where successive fixations of external factors become impossible. We consider ...
Added: June 27, 2026
Ivchenko A., Шестопёров А. И., Фомина Е. В., Microgravity Science and Technology 2025 Vol. 37 No. 19 P. 1–19
The paper is dedicated to the analysis of medico-biological data obtained during locomotor testing of astronauts. Accurate data interpretation plays a crucial role in locomotion system monitoring, prophylaxis of long-duration spaceflight negative effects and thus in the development of an autonomous medical support system for deep space expeditions. During the locomotor testing the astronaut changes ...
Added: June 26, 2026
Gadzhimirzaev S., Хельвас А. В., 2023 3rd International Conference on Innovative Research in Applied Science, Engineering and Technology (IRASET) Mohammedia, Morocco 2023 P. 1–6
The article proposes the architecture for eventdriven Emergency Operation Center with Machine Vision Component. Sources of information are analyzed and approaches to machine vision events for tactical situations detection and estimation are discussed. Messages from Machine Vision Components are converted to Common Alerting Protocol and processed by Operation Center environment for tactical situations recognition. ...
Added: June 26, 2026
Gadzhimirzaev S., Хельвас А. В., Лукьянченко П. П., Computer Research and Modeling 2023 Vol. 15 No. 1 P. 129–140
In this article we propose a new approach to the analysis of econometric industry parameters for the industry consolidation level. The research is based on the simple industry automatic control model. The state of the industry is measured by quarterly obtained econometric parameters from each industry’s company provided by the tax control regulator. An approach ...
Added: June 26, 2026
Gadzhimirzaev S., Хельвас А. В., International Frequency Sensor Association (IFSA) Publishing, 19-21 February 2025 Granada, Spain 2025 P. 172–176
The paper presents models for an innovative fully robotic warehouse for storing boxed goods. A discrete multiagent simulation of the movement of shuttles in a warehouse for a given sequence of pallet shipments has been implemented. Different strategies for placement of boxes in various areas of a warehouse are evaluated, as well as optimal routing ...
Added: June 26, 2026
Fedorov Timofey, Moscow Mathematical Journal 2026 Vol. 26 No. 1 P. 73–85
We obtain a complete list of smooth projective threefolds over C for which the dimension of the space of vanishing cycles (in H2(Y,Q) of the smooth hyperplane section Y) equals 2. We also obtain a complete list of rank 2 very ample vector bundles E on smooth projective surfaces with c2(E)=3. ...
Added: June 25, 2026
Воронеж: Издательский дом ВГУ, 2026.
В сборнике представлены материалы докладов и лекций, включенных в программу весенней математической школы. ...
Added: June 25, 2026
Воронеж: Издательский дом ВГУ, 2026.
В сборнике представлены материалы докладов и лекций,
включенных в программу Воронежской зимней матаматической школы С. Г. Крейна - 2026. ...
Added: June 25, 2026
Gadzhimirzaev S., Хельвас А. В., Computer Research and Modeling 2026 Vol. 18 No. 2 P. 423–438
This article presents a model of a fully automated warehouse with deep storage racks designed
for boxed goods storage. The study focuses on optimizing warehouse operations through discrete
multiagent simulation of shuttle movements for pallet loading and unloading tasks. The authors
investigate various product placement strategies, including the Nearest Channel Positioning Algorithm
(NCPA), Most Empty ChannelGroup Placement (MECGP), and ...
Added: June 24, 2026
Gaianov N., Parusnikova A., Уфимский математический журнал 2026 Т. 18 № 2 С. 14–22
We consider an algebraic 𝑞–difference equation. We propose a sufficient condition for the existence of a formal power–logarithmic expansion in the vicinity of zero of the solution to such an equation. We apply this sufficient condition to construct the formal expansion of a solution to a certain 𝑞–difference analogue of the fifth Painlevé equation for
particular ...
Added: June 24, 2026
Кошелев М. М., Shabanov D. A., Шайхеева Т. М., Успехи математических наук 2025 Т. 80 № 1(481) С. 161–162
In the paper we obtain new estimates of threshold probabilities for the properties of fractional (r:2)-colorings of a random hypergraph in the binomial model H(n,k,p). ...
Added: February 4, 2025
Popova S., Discrete Applied Mathematics 2024 Vol. 345 P. 215–225
The notion of spectrum for first-order properties introduced by J. Spencer for Erdős–Rényi random graph is considered in relation to random uniform hypergraphs. In this work we study the set of limit points of the spectrum for first-order formulae with bounded quantifier depth and obtain bounds for its maximum value. Moreover, we prove zero–one k-laws for ...
Added: February 3, 2024
Tiapkin D., Shabanov D. A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2023 Т. 512 № 1 С. 52–57
The paper deals with the structure of the set of panchromatic colorings with three colors of a random hypergraph in the uniform model $H(n,k,m)$. It is well known that the property of the existence of a panchromatic coloring with given number of colors $r$ has the sharp threshold, i.e. there exists the threshold value $\widehat{m}_r=\widehat{m}_r(n)$ ...
Added: November 30, 2023
Денисов И. О., Shabanov D. A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2023 Т. 509 № 1 С. 28–35
The paper deals with the study of the limit distribution of the j-chromatic numbers of a random k-uniform hypergraph in the binomial model H(n,k,p). We consider the sparse case when the expected number of edges is a linear function of the number of vertices n, i.e. is equal to cn for c>0 not depending on n. We ...
Added: October 25, 2023
Alina Khuzieva, Matveeva T., Dmitry Shabanov, Moscow Journal of Combinatorics and Number Theory 2023 Vol. 12 No. 1 P. 57–88
The paper deals with strong r-colorings of a random k-uniform hypergraph in the binomial model H(n,k,p). A vertex coloring is said to be strong for a hypergraph if any two vertices that share a common edge are colored with distinct colors. We consider the sparse case when the expected number of edges is equal to cn and the values r≥k≥3, c>0 remain constant ...
Added: April 10, 2023
Демидович Ю. А., Shabanov D. A., Теория вероятностей и ее применения 2022 Т. 67 № 2 С. 223–246
Работа посвящена изучению предельной концентрации значений хроматического числа случайного гиперграфа в биномиальной модели H(n,k,p). Доказано, что при фиксированном k>2 и не слишком быстро растущем значении n^{k-1}p хроматическое число H(n,k,p) с вероятностью, стремящейся к 1, принадлежит множеству из некоторых двух соседних значений. Кроме того, показано, что при чуть более сильных ограничениях на рост n^{k-1}p данные значения ...
Added: January 11, 2023
Матвеева Т. Г., Khuzieva A., Shabanov D. A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2022 Т. 502 С. 37–41
The paper deals with the study of the probability threshold for the property of strong colorability with given number of colors of the random k-uniform hypergraph in the binomial model H(n,k,p). A vertex coloring of a hypergraph is said to be strong if any edge does not have two vertices of the same color under ...
Added: January 11, 2023
Семенов А. С., Shabanov D. A., Проблемы передачи информации 2022 Т. 58 № 1 С. 80–111
We study the threshold probability for the property of existence of a special-form r-coloring for a random k-uniform hypergraph in the H(n, k, p) binomial model. A parametric set of j-chromatic numbers of a random hypergraph is considered. A coloring of hypergraph vertices is said to be j-proper if every edge in it contains no ...
Added: April 20, 2022
Денисов И. О., Shabanov D. A., Дискретная математика 2021 Т. 33 № 4 С. 32–46
The paper deals with asymptotic behavior of the general independence numbers of random hypergraphs in the binomial model. We prove that there is a concentration of the values of the independence numbers in two consecutive numbers under the certain conditions on the parameters. ...
Added: April 20, 2022
Zakharov P., Shabanov D. A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2021 Т. 501 С. 26–30
This paper deals with the problem of finding the max-cut for random hypergraphs. We consider the classical binomial model H(n,k,p) of a random k-uniform hypergraph on n vertices with probability p=p(n). The main results generalize previously known facts for the graph case and show that in the sparse case (when the expected number of edges ...
Added: April 20, 2022
Demidovich Y., Shabanov D. A., , in: Recent Developments in Stochastic Methods and Applications: ICSM-5, Moscow, Russia, November 23–27, 2020, Selected ContributionsVol. 371.: Springer, 2021. P. 190–203.
Added: September 23, 2021
Shabanov D. A., Zakharov P., , in: Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and ApplicationsVol. 14.: Cham: Birkhäuser, 2021. P. 817–822.
The paper deals with the max-cut problem for random hypergraphs. We consider a binomial model of a random k-uniform hypergraph H(n, k, p) for some fixed k≥3k≥3, growing n and p=p(n)p=p(n). For given natural number q, the max-q-cut for a hypergraph is the maximal possible number of edges that can be properly colored with q colors under the same coloring. Generalizing the known results for graphs ...
Added: September 8, 2021