Related papers: Double dimers on planar hyperbolic graphs via circ…
Two planar embedded circle patterns with the same combinatorics and the same intersection angles can be considered to define a discrete conformal map. We show that two locally finite circle patterns covering the unit disc are related by a…
We study the nonlinear supersymmetric hyperbolic sigma model introduced by Zirnbauer in 1991. This model can be related to the mixing measure of a vertex- reinforced jump process. We prove that the two-point correlation function has a…
We study the directed polymer model in dimension ${1+1}$ when the environment is heavy-tailed, with a decay exponent $\alpha\in(0,2)$. We give all possible scaling limits of the model in the weak-coupling regime, i.e., when the inverse…
We study random surfaces which arise as height functions of random perfect matchings (a.k.a. dimer configurations) on an weighted, bipartite, doubly periodic graph G embedded in the plane. We derive explicit formulas for the surface tension…
If we perturb a completely integrable Hamiltonian system with two degrees of freedom, the perturbed flow might display, on every energy level, invariant sets that are laminations over Aubry-Mather sets of a Poincar\'e section of the flow.…
We study planar "vertex" models, which are probability measures on edge subsets of a planar graph, satisfying certain constraints at each vertex, examples including dimer model, and 1-2 model, which we will define. We express the local…
Starting from a three dimensional Hamiltonian, we study the optical properties of ultra-thin topological insulator slabs for which the coupling between Dirac fermions on opposite surfaces results in two degenerated gapped hyperbolic bands.…
In this article the authors continue the discussion in \cite{ALM} about inverse problems for second order elliptic and hyperbolic equations on metric trees from boundary measurements. In the present paper we prove the identifiability of…
We describe the relationship between dimer models on the real two-torus and coamoebas of curves in (\CC^\times)^2. We show, inter alia, that the dimer model obtained from the shell of the coamoeba is a deformation retract of the closed…
Erd\H{o}s and P\'{o}sa proved in 1965 that there is a duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold if we restrict to odd cycles. However, in…
The spectrum of massless Dirac electrons on the side surface of a three-dimensional weak topological insulator is significantly affected by whether the number of unit atomic layers constituting the sample is even or odd; it has a…
Twin-width is a width parameter introduced by Bonnet, Kim, Thomass\'e and Watrigant [FOCS'20, JACM'22], which has many structural and algorithmic applications. We prove that the twin-width of every graph embeddable in a surface of Euler…
The connected tree-width of a graph is the minimum width of a tree-decomposition whose parts induce connected subgraphs. Long cycles are examples of graphs that have small tree-width but large connected tree-width. We show that a graph has…
In this paper, we prove that given a hyperbolic polyhedral metric with an inversive distance circle packing, and a target discrete curvature satisfying Gauss-Bonnet formula, there exist a unique inversive distance circle packing which is…
We give a proof of an unpublished result of Thurston showing that given any hyperbolic metric on a surface of finite type with nonempty boundary, there exists another hyperbolic metric on the same surface for which the lengths of all simple…
We study the $O(n)$ model on graphs quasi-isometric to the hyperbolic plane, with free boundary conditions. We observe that the pair correlations decay exponentially with distance, for all temperatures, if and only if $n>1$.
We are interested in evolution phenomena on star-like networks composed of several branches which vary considerably in physical properties. The initial boundary value problem for singularly perturbed hyperbolic differential equation on a…
The hyperbolicity of a graph, informally, measures how close a graph is (metrically) to a tree. Hence, it is intuitively similar to treewidth, but the measures are formally incomparable. Motivated by the broad study of algorithms and…
With the help of hyper-ideal circle pattern theory, we have developed a discrete version of the classical uniformization theorems for surfaces represented as finite branched covers over the Riemann sphere as well as compact polyhedral…
In a graph $G$, a vertex dominates itself and its neighbors. A subset $S\subseteq V(G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least twice. The double domination number $\gamma_{\times 2}(G)$ is…