Related papers: Bipartite dimer model: perfect t-embeddings and Lo…
Tutte's spring embedding theorem states that, for a three-connected planar graph, if the outer face of the graph is fixed as the complement of some convex region in the plane, and all other vertices are placed at the mass center of their…
Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…
We explicitly describe cellular minimal free resolutions of certain classes of edge ideals of weighted complete bipartite graphs based on a construction of Visscher. Specifically, we show that Visscher's construction minimally resolves all…
We establish a precise correspondence between points of momentum amplituhedra and origami crease patterns. As an application, we prove that the BCFW cells triangulate the momentum amplituhedron when all Mandelstam variables are nonnegative.…
Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. We propose the systematic use of symmetric spaces in representation learning,…
We show that the number Z of q-edge-colourings of a simple regular graph of degree q is deducible from functions describing dimers on the same graph, viz. the dimer generating function or equivalently the set of connected dimer correlation…
In his seminal paper published in 2000 Kenyon developed a method to study the height function of the planar dimer model via discrete complex analysis tools. The core of this method is a set of identities representing height correlations…
We consider Hermite-Pad\'e approximants in the framework of discrete integrable systems defined on the lattice $\mathbb{Z}^2$. We show that the concept of multiple orthogonality is intimately related to the Lax representations for the…
A nontrivial connected graph is matching covered if each edge belongs to some perfect matching. For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs; thus, there is extensive literature on…
We introduce a novel approach to Maximum A Posteriori inference based on discrete graphical models. By utilizing local Wasserstein distances for coupling assignment measures across edges of the underlying graph, a given discrete objective…
We find conditions under which the restriction of a divergence-free vector field $B$ to an invariant toroidal surface $S$ is linearisable. The main results are similar in conclusion to Arnold's Structure Theorems but require weaker…
We show that if an interlacing particle system in a two-dimensional lattice is a determinantal point process, and the correlation kernel can be expressed as a double integral with certain technical assumptions, then the moments of the…
Moser's Bernstein theorem \cite{moser61} says that an entire minimal graph of codimension 1 with bounded slope must be a hyperplane. An analogous result for arbitrary codimension is not true, by an example of Lawson-Osserman. Here, we show…
Totally symmetric self-complementary plane partitions (TSSCPPs) are boxed plane partitions with the maximum possible symmetry. We use the well-known representation of TSSCPPs as a dimer model on a honeycomb graph enclosed in one-twelfth of…
We introduce the matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree. A…
We present an application of the Grassmann algebra to the problem of the monomer-dimer statistics on a two-dimensional square lattice. The exact partition function, or total number of possible configurations, of a system of dimers with a…
Bipartite graph embedding has recently attracted much attention due to the fact that bipartite graphs are widely used in various application domains. Most previous methods, which adopt random walk-based or reconstruction-based objectives,…
Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…
The Dulmage--Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matchings therein. A bipartite graph is said to be DM-irreducible if…
We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric…