Zobrazeno 1 - 10
of 3 685
pro vyhledávání: '"Gladkov, A"'
Autor:
Aliyev, Fateh, Gladkov, Nikita
We establish a lower bound on the forcing numbers of domino tilings computable in polynomial time based on height functions. This lower bound is sharp for a 2n by 2n square as well as other cases.
Comment: 10 pages, 4 figures
Comment: 10 pages, 4 figures
Externí odkaz:
http://arxiv.org/abs/2410.23621
Autor:
Butakov, Ivan, Sememenko, Alexander, Tolmachev, Alexander, Gladkov, Andrey, Munkhoeva, Marina, Frolov, Alexey
Deep InfoMax (DIM) is a well-established method for self-supervised representation learning (SSRL) based on maximization of the mutual information between the input and the output of a deep neural network encoder. Despite the DIM and contrastive SSRL
Externí odkaz:
http://arxiv.org/abs/2410.06993
We give an explicit counterexample to the Bunkbed Conjecture introduced by Kasteleyn in 1985. The counterexample is given by a planar graph on $7222$ vertices, and is built on the recent work of Hollom (2024).
Comment: 12 pages, 2 figures
Comment: 12 pages, 2 figures
Externí odkaz:
http://arxiv.org/abs/2410.02545
Autor:
Gladkov, Nikita
The use of decision trees for percolation inequalities started with the celebrated O'Donnell--Saks--Schramm--Servedio (OSSS) inequality. We prove decision tree generalizations of the Harris--Kleitman (HK), van den Berg--Kesten (vdBK), and other inequ
Externí odkaz:
http://arxiv.org/abs/2408.08457
Autor:
Gladkov, Nikita, Pak, Igor
We consider a probabilistic version of the depth-first search on mazes with two exits, and show that this algorithm has equal probability of finding either exit. The proof is combinatorial and uses an explicit involution.
Comment: This paper is
Comment: This paper is
Externí odkaz:
http://arxiv.org/abs/2408.00978
Autor:
Zürn, Jannik, Gladkov, Paul, Dudas, Sofía, Cotter, Fergal, Toteva, Sofi, Shotton, Jamie, Simaiaki, Vasiliki, Mohan, Nikhil
We present WayveScenes101, a dataset designed to help the community advance the state of the art in novel view synthesis that focuses on challenging driving scenes containing many dynamic and deformable elements with changing geometry and texture. Th
Externí odkaz:
http://arxiv.org/abs/2407.08280
Autor:
Gladkov, Nikita, Zimin, Aleksandr
We show that a site percolation is a stronger model than a bond percolation. We use the van den Berg -- Kesten (vdBK) inequality to prove that site percolation on a neighborhood of a vertex of degree $3$ cannot be simulated even approximately by bond
Externí odkaz:
http://arxiv.org/abs/2404.08873
Autor:
Gladkov, Alexander
In this paper we consider initial boundary value problem for a parabolic equation with nonlinear memory and absorption under nonlinear nonlocal boundary condition. We prove global existence and blow-up of solutions.
Comment: arXiv admin note: su
Comment: arXiv admin note: su
Externí odkaz:
http://arxiv.org/abs/2402.05040
Raman lasers is an actively developing field of nonlinear optics aiming to create efficient frequency converters and various optical sensors. Due to the growing importance of ultracompact chip-scale technologies, there is a constant demand for optica
Externí odkaz:
http://arxiv.org/abs/2307.10850
Autor:
Gladkov, Nikita, Pak, Igor
For uniform random 4-colorings of graph edges with colors a,b,c,d, every two colors form a 1/2-percolation, and every two overlapping pairs of colors form independent 1/2-percolations. We show joint positive dependence for pairs of colors ab, ac and
Externí odkaz:
http://arxiv.org/abs/2307.09606