Related papers: Double dimers on planar hyperbolic graphs via circ…
The dimer tiling problem asks in how many ways can the edges of a graph be covered by dimers so that each site is covered once. In the special case of a planar graph, this problem has a solution in terms of a free fermionic field theory. We…
In a graph $G$, a vertex dominates itself and its neighbors. A subset $S$ of vertices of $G$ is a double dominating set of $G$ if every vertex is dominated by at least two vertices in $S$. The double domination number $\gamma_{\times 2}(G)$…
We study the number of limit cycles and the bifurcation diagram in the Poincar\'{e} sphere of a one-parameter family of planar differential equations of degree five $\dot {\bf x}=X_b({\bf x})$ which has been already considered in previous…
We show that for any closed surface of genus greater than one and for any finite weighted graph filling the surface, there exists a hyperbolic metric which realizes the least Dirichlet energy harmonic embedding of the graph among a fixed…
We study a fermionic two-band model with the interband transition resonantly coupled to a cavity. This model was recently proposed to explain cavity-enhanced charge transport, but a thorough characterization of the closed system, in…
This paper addresses the existence and regularity of weak solutions for a fully parabolic model of chemotaxis, with prevention of overcrowding, that degenerates in a two-sided fashion, including an extra nonlinearity represented by a…
In this paper, we study discrepancy questions for spanning subgraphs of $k$-uniform hypergraphs. Our main result is that, for any integers $k \ge 3$ and $r \ge 2$, any $r$-colouring of the edges of a $k$-uniform $n$-vertex hypergraph $G$…
We identify the upper large deviation probability for the number of edges in scale-free geometric random graph models as the space volume goes to infinity. Our result covers the models of scale-free percolation, the Boolean model with…
Motivated by the transmission of topological surface states through atomic scale steps, we study the transport of gapless Dirac fermions on hyperbolic surfaces. We confirm that, independent of the curvature of the hyperbolae and the…
We consider the disordered monomer-dimer model on cylinder graphs $\mathcal{G}_n$, i.e., graphs given by the Cartesian product of the line graph on $n$ vertices, and a deterministic graph. The edges carry i.i.d. random weights, and the…
We explore the topological properties of non-Hermitian nodal-link semimetals with dissipative cold atoms in a three-dimensional optical lattice. We construct a two-band continuum model in three dimensions with a spin-dependent gain and…
We consider inhomogeneous spatial random graphs on the real line. Each vertex carries an i.i.d. weight and edges are drawn such that short edges and edges to vertices with large weights occur with higher probability. This allows the study…
Let M be a hyperbolic 3-manifold with nonempty totally geodesic boundary. We prove that there are upper and lower bounds on the diameter of the skinning map of M that depend only on the volume of the hyperbolic structure with totally…
We study the classical hard-core dimer model on the triangular lattice. Following Kasteleyn's fundamental theorem on planar graphs, this problem is soluble by Pfaffians. This model is particularly interesting for, unlike the dimer problems…
The notion of robust expansion has played a central role in the solution of several conjectures involving the packing of Hamilton cycles in graphs and directed graphs. These and other results usually rely on the fact that every robustly…
We give an efficient perfect sampling algorithm for weighted, connected induced subgraphs (or graphlets) of rooted, bounded degree graphs. Our algorithm utilizes a vertex-percolation process with a carefully chosen rejection filter and…
In a recent breakthrough, Kelley and Meka (FOCS 2023) obtained a strong upper bound on the density of sets of integers without nontrivial three-term arithmetic progressions. In this work, we extend their result, establishing similar bounds…
Graphical models have proven to be powerful tools for representing high-dimensional systems of random variables. One example of such a model is the undirected graph, in which lack of an edge represents conditional independence between two…
The detour between two points u and v (on edges or vertices) of an embedded planar graph whose edges are curves is the ratio between the shortest path in in the graph between u and v and their Euclidean distance. The maximum detour over all…
We study constrained percolation models on planar lattices including the $[m,4,n,4]$ lattice and the square tilings of the hyperbolic plane, satisfying certain local constraints on faces of degree 4, and investigate the existence of…