Related papers: Bipartite dimer model: perfect t-embeddings and Lo…
This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…
We study asymptotics of perfect matchings on a large class of graphs called the contracting square-hexagon lattice, which is constructed row by row from either a row of a square grid or a row of a hexagonal lattice. We assign the graph…
The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…
We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…
We consider the problem of embedding a finite set of points $\{x_1, \ldots, x_n\} \in \mathbb{R}^d$ that satisfy $\ell_2^2$ triangle inequalities into $\ell_1$, when the points are approximately low-dimensional. Goemans (unpublished,…
This paper explores the connection between perfect t-embeddings and the octahedron equation in the setting of the two-periodic Aztec diamond. In particular, we show that the positions of both the t-embedding and the corresponding origami…
We study the dimer model for a planar bipartite graph N embedded in a disk, with boundary vertices on the boundary of the disk. Counting dimer configurations with specified boundary conditions gives a point in the totally nonnegative…
A perfect $K_t$-matching in a graph $G$ is a spanning subgraph consisting of vertex disjoint copies of $K_t$. A classic theorem of Hajnal and Szemer\'edi states that if $G$ is a graph of order $n$ with minimum degree $\delta(G) \ge…
In this paper we develop a general approach to dimer models analogous to Krichever's scheme in the theory of integrable systems. We start with a Riemann surface and the simplest generic meromorphic functions on it and demonstrate how to…
This paper completes the comprehensive study of the dimer model on infinite minimal graphs with Fock's weights [arXiv:1503.00289] initiated in [arXiv:2007.14699]: the latter article dealt with the elliptic case, i.e., models whose…
We consider the sigma models where the base metric is proportional to the metric of the configuration space. We show that the corresponding sigma model equation admits a Lax pair. We also show that this type of sigma models in two…
We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…
Graph manifolds are manifolds that decompose along tori into pieces with a tame $S^1$-structure. In this paper, we prove that the simplicial volume of graph manifolds (which is known to be zero) can be approximated by integral simplicial…
For a family of integer-valued height functions defined over the faces of planar graphs, we establish a relation between the probability of connection by level sets and the spin-spin correlations of the dual $O(2)$ symmetric spin models…
In 2000, Cohn, Kenyon and Propp studied uniformly random perfect matchings of large induced subgraphs of $\mathbb Z^2$ (a.k.a. dimer configurations or domino tilings) and developed a large deviation theory for the associated height…
In Part I, we develop the notions of a Moebius structure and a conformal Cartan geometry, establish an equivalence between them; we use them in Part II to study submanifolds of conformal manifolds in arbitrary dimension and codimension. We…
We construct a parabolic entire minimal graph $S$ over a finite topology complete Riemannian surface $\Sigma$ of curvature $-1$ and infinite area (thus of non-parabolic conformal type). The vertical projection of this graph yields a…
We establish an isomorphism between the Grothendieck-Teichm\"uller Lie algebra $\mathfrak{grt}_1$ in depth two modulo higher depth and the cohomology of the two-loop part of the graph complex of internally connected graphs…
We introduce a new optimization problem regarding embeddings of a graph into a Euclidean space and discuss its relation to the two, mutually dual, optimizations problems introduced by Goering-Helmberg-Wappler. We prove that the Laplace…
We study perfect matchings on the square-hexagon lattice with $1\times n$ periodic edge weights such that the boundary condition is given by either (1) each remaining vertex on the bottom boundary is followed by $(m-1)$ removed vertices;…