?
Bounded quantifier depth spectrum for random uniform hypergraphs
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 the random uniform hypergraph and improve the bounds for the maximum value of the spectrum for first-order formulae with bounded quantifier depth. We obtain that the maximum value of the spectrum belongs to some two-element set.
Prokofev V., Zabrodin A., Proceedings of the Steklov Institute of Mathematics 2020 Vol. 309 P. 225–239
We consider solutions of the matrix Kadomtsev-Petviashvili (KP) hierarchy that are trigonometric functions of the first hierarchical time t1 = x and establish the correspondence with the spin generalization of the trigonometric Calogero-Moser system at the level of hierarchies. Namely, the evolution of poles xi and matrix residues at the poles aαibβi of the solutions with respect to the kth hierarchical time of the ...
Added: July 14, 2026
Prokofev V., Zabrodin A., Journal of Physics A: Mathematical and Theoretical 2021 Vol. 54
We consider solutions of the Kadomtsev–Petviashvili hierarchy which are elliptic functions of x = t1. It is known that their poles as functions of t2 move as particles of the elliptic Calogero–Moser model. We extend this correspondence to the level of hierarchies and find the Hamiltonian Hk of the elliptic Calogero–Moser model which governs the dynamics of poles with respect to the kth ...
Added: July 14, 2026
Prokofev V., Zabrodin A., Theoretical and Mathematical Physics 2021 Vol. 208 P. 1093–115
We consider solutions of the 2D Toda lattice hierarchy which are elliptic functions of the zeroth time t_0=x. It is known that their poles as functions of t_1 move as particles of the elliptic Ruijsenaars-Schneider model. The goal of this paper is to extend this correspondence to the level of hierarchies. We show that the ...
Added: July 14, 2026
Prokofev V., Zabrodin A., Теоретическая и математическая физика 2023 Т. 217 № 2 С. 299–316
We continue the study of the B-Toda hierarchy (the Toda lattice with the constraint of type B), which can be regarded as a discretization of the BKP hierarchy. We introduce the tau function of the B-Toda hierarchy and obtain bilinear equations for it. Examples of soliton tau functions are presented in explicit form. ...
Added: July 14, 2026
Шиманогов И. Н., Vyalyi M., Дискретный анализ и исследование операций 2025 Т. 32 № 4 С. 213–230
A well-studied class of algorithmic problems is that of regular realizability: checking the non-emptiness of the intersection of a regular language with a given language. This problem has a natural algebraic interpretation: verifying whether an element of a Boolean algebra belongs to the kernel of a certain homomorphism. This motivates the consideration of an analogous ...
Added: July 12, 2026
Rybakov M., Annals of Pure and Applied Logic 2026 Vol. 177 Article 103811
The paper presents a solution to the question about the decidability of the two-variable fragment of the superintuitionistic predicate logic QLC defined by the class of linear Kripke frames, which is also the ‘superintuitionistic’ fragment of the modal predicate logic QS4.3, under the Gödel translation. We prove that the fragment is undecidable. The result remains true for the ...
Added: July 11, 2026
Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.
This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...
Added: July 9, 2026
Springer, 2027.
The series Lecture Notes in Computer Science (LNCS), including its subseries Lecture Notes in Artificial Intelligence (LNAI) and Lecture Notes in Bioinformatics (LNBI), has established itself as a medium for the publication of new developments in computer science and information technology research, teaching, and education. LNCS enjoys close cooperation with the computer science R & ...
Added: July 8, 2026
Маликов М. А., Монахова Э. А., Rzaev E. et al., Ученые записки Казанского университета. Серия: Физико-математические науки 2026 Т. 168 № 2 С. 269–286
This article examines series of families of two-dimensional circulant networks with rectangular
L -shapes, optimal in diameter, as network-on-chip topologies with a minimal number of crossings
between the links and a bounded length of the maximum link that does not depend on the network
size. New network-on-chip routing algorithms, which use the coordinates of three adjacent zeros in
the ...
Added: July 8, 2026
Pilé I., Shchur L., Deng Y., Physical Review B: Condensed Matter and Materials Physics 2026 Vol. 114 Article 014101
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Swendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for models in different universality classes: Ising model, Potts model with three components, and four-state Potts model. The overlap of two ...
Added: July 6, 2026
Irkutsk: ISDCT SB RAS, 2026.
We study a model problem on the filtration of a conducting fluid through a
porous layer. A porous medium is presented as an assemblage of identical spherical
cells. Each cell consists of a porous core and liquid shell. We derive apriori estimates
for flow characteristics which show the specific behavior of the fluid. Our estimates
are validated numerically. ...
Added: July 5, 2026
М.: Наука и технологии, 2026.
«Телекоммуникации» ежемесячный рецензируемый производственный, информационно-аналитический и учебно-методический журнал выходит в свет с июля 2000 г.
Для руководителей и работников промышленности, научно-исследовательских и проектно-конструкторских институтов, высших учебных заведений, аспирантов и студентов, а также для специалистов, разрабатывающих, выпускающих и эксплуатирующих средства телекоммуникаций.
Новости разработок и производства, прогнозы развития, защита информации, Нормативные, справочные, аналитические и учебно-методические материалы.
Переход к глобальному информационному ...
Added: July 4, 2026
МФТИ, 2025.
абота редакции научного журнала «Труды Московского физико-технического института» (кратко «Труды МФТИ»), редакционной коллегии и редакционного совета осуществляется в соответствии с Положением, утвержденным ректором института. В состав редакционной коллегии входят руководители института, факультетов, институтских и факультетских кафедр. Главный редактор журнала —президент МФТИ, член-корр. РАН Кудрявцев Н.Н.
Журнал «Труды МФТИ» входит в базу данных РИНЦ (Российский Индекс Научного Цитирования) и доступен в электронной ...
Added: July 4, 2026
Springer, 2026.
This book presents established and new research on the close connections between graph games and systems of logic, particularly existing and newly designed modal logics. The volume utilizes two graph games – the sabotage game and the hide-and-seek game – to demonstrate the natural interplay between designing new graph games and exploring new kinds of ...
Added: June 30, 2026
Pochinka O., Barinova M., Journal of Geometry and Physics 2026 Vol. 228 P. 1–8
In the present paper we consider an Ω-stable 3-diffeomorphism with a solid or thickened surfaced non-trivial basic set. Such basic sets include, for instance, all one-dimensional expanding attractors and those two-dimensional basic sets that are not expanding. We prove that the chain recurrent set of every such a diffeomorphism necessarily contains at least two non-trivial ...
Added: June 30, 2026
German O., Illarionov A., Известия РАН. Серия математическая 2026 Т. 90 № 3 С. 3–18
Пусть симплекс с целочисленными вершинами - содержащий ровно одну целочисленную точку, отличную от своих вершин. В работе доказывается, что если точка находится во внутренности симплекса или в относительной внутренности некоторой гиперграни симплекса, то объем симплекса ограничен величиной, зависящей только от размерности, в противном случае объем симплекса может быть сколь угодно большим. Этот результат применяется для вывода асимптотической формулы для среднего числа вершин полиэдров ...
Added: June 29, 2026
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
Zakharov P., Shabanov D. A., Успехи математических наук 2023 Т. 78 № 6 (474) С. 183–184
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). ...
Added: November 30, 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
Matushkin A. D., Popova S., Discrete Mathematics 2022 Vol. 345 No. 6 Article 112835
In this work we describe the spectra of all rational numbers that could be a density of a strictly balanced uniform hypergraph. We also introduce some specific constructions of strictly balanced uniform hypergraphs, and exploit them to generalize some results about Zero-One Law and Zero-One k-Law to the case of random uniform hypergraphs. ...
Added: June 29, 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