38 citations · 66 across the 9 of their papers we have counts for
12 papers
Lower bounds on the independence numbers of distance graphs with vertices in
A. R. Akhiiarov, A. V. Bobu, A. M. Raigorodskii
This work is devoted to lower bounds on independence numbers of distance graphs with vertices in . The asymptotic case is studied, yielding new results over a broad r…
A note on Borsuk's problem in Minkowski spaces
Andrei M. Raigorodskii, Arsenii Sagdeev
In 1993, Kahn and Kalai famously constructed a sequence of finite sets in -dimensional Euclidean spaces that cannot be partitioned into less than …
Stochastic optimization in digital pre-distortion of the signal
A. V. Alpatov, E. A. Peters, D. A. Pasechnyuk +1
In this paper, we test the performance of some modern stochastic optimization methods and practices in application to digital pre-distortion problem, that is a valuable part of pro…
Large cycles in random generalized Johnson graphs
Vladislav Kozhevnikov, Andrey Raigorodskii, Maksim Zhukovskii
This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are ob…
Improved estimate of the number of edges in subgraphs of the special distance graph
Philipp Pushnyakov, Andrei M. Raigorodskii
In this work authors significantly improved previous estimates of the number of edges in subgraphs of the special distance graph.
Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods
Lev Bogolubsky, Pavel Dvurechensky, Alexander Gasnikov +5
In this paper, we consider a non-convex loss-minimization problem of learning Supervised PageRank models, which can account for some properties not considered by classical approach…
On the chromatic numbers of small-dimensional Euclidean spaces
Danila Cherkashin, Anatoly Kulikov, Andrey Raigorodskii
The paper is devoted to the study of graph sequence G_n = (V_n, E_n) where V_n is the set of all vectors v in R^n with coordinates from {-1, 0, 1} such that |v| = sqrt(3), and E_n…
New bounds for the distance Ramsey number
Andrey Kupavskii, Andrei Raigorodskii, Maria Titova
In this paper we study the distance Ramsey number . The \textit{distance Ramsey number} is the minimum number such that for any graph $ G…
Distance graphs having large chromatic numbers and not containing cliques or cycles of given size
Evgeniy Demekhin, Andrei Raigorodskii, Oleg Rubanov
In this work, the classical Nelson -- Hadwiger problem is studied which lies on the edge of combinatorial geometry and graph theory. It concerns colorings of distance graphs in $ {…
About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3
D. D. Cherkashin, A. B. Kulikov, A. M. Raigorodskii
In 1973 P. Erdős and L. Lovász noticed that any hypergraph whose edges are pairwise intersecting has chromatic number 2 or 3. In the first case, such hypergraph may have any number…
On the chromatic numbers of spheres in
Andrei Raigorodskii
In this paper, we obtain new asymptotic lower bounds for the chromatic numbers of spheres.
Counterexamples to Borsuk's conjecture on spheres of small radii
Andrei Kupavskii, Andrei Raigorodskii
In this work, the classical Borsuk conjecture is discussed, which states that any set of diameter 1 in the Euclidean space can be divided into parts of sm…