Related papers: Double dimers on planar hyperbolic graphs via circ…
We extend the discontinuous Galerkin (DG) framework to the analysis of first-order hyperbolic and advection-dominated problems posed on implicitly defined surfaces. The focus will be on the hyperbolic part, which is discretised using a…
We relate the planar random current representation introduced by Griffiths, Hurst and Sherman to the dimer model. More precisely, we provide a measure-preserving map between double random currents (obtained as the sum of two independent…
We consider dyonic black hole in hyperscaling violating Lifshitz theories arised in a four dimensional Einstein-Maxwell-dilaton system along with axion fields. Considering the linearised equation of relevant fluctuations in metric and gauge…
The coupled discrete linear and Kerr nonlinear Schrodinger equations with gain and loss describing transport on dimers with parity-time PT symmetric potentials are considered. The model is relevant among others to experiments in optical…
We study a finite sequence of graphs, beginning with the curve graph and ending with a graph quasi-isometric to a tree. There is a Lipschitz map from one graph in the sequence to the next. This sequence was first introduced by Hamenst\"adt.…
We consider the monomer-dimer model on sequences of random graphs locally convergent to trees. We prove that the monomer density converges almost surely, in the thermodynamic limit, to an analytic function of the monomer activity. We…
We study Bernoulli$(p)$ percolation on (non)unimodular quasi-transitive graphs and prove that, almost surely, for any two heavy clusters $C$ and $C'$, the set of vertices in $C$ within distance one of $C'$ is light, i.e. it has finite total…
We supply a proof of the fact that a hyperbolic 3-manifold $M$ with finitely generated fundamental group and with no parabolics is topologically tame. This proves the Marden's conjecture. Our approach is to form an exhaustion $M_i$ of $M$…
Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\rm W[1]$-hard on general graphs, they have been shown to be fixed-parameter tractable on many sparse graph classes, including…
There are many four vertex type theorems appearing in the literature, coming in both smooth and discrete flavors. The most familiar of these is the classical theorem in differential geometry, which states that the curvature function of a…
In this paper we construct spanning trees in hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has a bounded number of distinct rays to each boundary point. The bound depends only on the…
We study asymptotic behaviors of solutions $f$ to the Dirichlet problem for minimal graphs in the hyperbolic space with singular asymptotic boundaries under the assumption that the boundaries are piecewise regular with positive curvatures.…
By a symmetric double graph we mean a hypersurface which is mirror-symmetric and the two symmetric parts are graphs over the hyperplane of symmetry. We prove that there is a weak solution of mean curvature flow that preserves these…
We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $\Omega(\sqrt{n})$. This improves on the…
The planar Tur\'an number of a graph $H$, denoted by $ex_{_\mathcal{P}}(n,H)$, is the largest number of edges in a planar graph on $n $ vertices without containing $H$ as a subgraph. In this paper, we continue to study the topic of…
A classic result of Asplund and Gr\"unbaum states that intersection graphs of axis-aligned rectangles in the plane are $\chi$-bounded. This theorem can be equivalently stated in terms of path-decompositions as follows: There exists a…
We provide a new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model. The proof applies to infinite range models on arbitrary locally finite transitive infinite graphs. For Bernoulli percolation, we…
We introduce a novel property of bounded Voronoi tessellations that enables cycle-free mesh sweeping algorithms. We prove that a topological sort of the dual graph of any Voronoi tessellation is feasible in any flow direction and dimension,…
The problem of steady mixed convection boundary-layer flow on a cooled vertical permeable circular cylinder embedded in a fluid-saturated porous medium is studied. Here, we evaluate the flow and heat transfer characteristics numerically for…
We discuss two generalizations of the collar lemma. The first is the stable neighborhood theorem which says that a (not necessarily simple) closed geodesic in a hyperbolic surface has a \lq\lq stable neighborhood\rq\rq whose width only…