相关论文: Full support of the Kasteleyn operator associated …
The determinant method of Kasteleyn gives a method of computing the number of perfect matchings of a planar bipartite graph. In addition, results of Bernardi exhibit a bijection between spanning trees of a planar bipartite graph and…
Maximal minors of Kasteleyn sign matrices on planar bipartite graphs in the disk count dimer configurations with prescribed boundary conditions, and the weighted version of such matrices provides a natural parametrization of the totally…
We prove that the class of cluster integrable systems constructed by Goncharov and Kenyon out of the dimer model on a torus coincides with the one defined by Gekhtman, Shapiro, Tabachnikov, and Vainshtein using Postnikov's perfect networks.…
We construct perfect t-embeddings for regular hexagons of the hexagonal lattice, providing the first example, and hence proving existence, for graphs with an outer face of degree greater than four. The construction is in terms of the…
On a finite weighted graph, the dimer model is a probability measure on its dimer covers, that assigns to any cover a probability proportional to the product of the weights of its edges. For planar bipartite graphs, dimer correlations are…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
The $k$-matching polytope of a graph is the convex hull of all its matchings of a given size $k$ when they are considered as indicator vectors. In this paper, we prove that the $k$-matching polytope of a bipartite graph is normal, that is,…
Haxell's condition is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell's condition holds it forces the…
We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph…
We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear polynomial over the Reals. We show that it has full degree and $(1-o_n(1))\cdot 2^{n^2}$ monomials with non-zero coefficients. In contrast, we show…
Consider a semi-regular hexagon on the triangular lattice (that is, the lattice consisting of unit equilateral triangles, drawn so that one family of lines is vertical). Rhombus (or lozenge) tilings of this region may be represented in at…
Given a consistent bipartite graph $\Gamma$ in $T^2$ with a complex-valued edge weighting $\mathcal{E}$ we show the following two constructions are the same. The first is to form the Kasteleyn operator of $(\Gamma, \mathcal{E})$ and pass to…
A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based on a branch decomposition. It was introduced by Norine and…
The approximate degree of a Boolean function is the least degree of a real multilinear polynomial approximating it in the $\ell_\infty$-norm over the Boolean hypercube. We show that the approximate degree of the Bipartite Perfect Matching…
We determine for which $n$, the complete bipartite graph $K_{n,n}$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.
Led by the key example of the Korteweg-de Vries equation, we study pairs of Hamiltonian operators which are non-homogeneous and are given by the sum of a first-order operator and an ultralocal structure. We present a complete classification…
The matching polytope of a graph $G$ is the convex hull of the indicator vectors of the matchings on $G$. We characterize the graphs whose associated matching polytopes are Gorenstein, and then prove that all Gorenstein matching polytopes…
We describe many different realizations with integer coordinates for the associahedron (i.e. the Stasheff polytope) and for the cyclohedron (i.e. the Bott-Taubes polytope) and compare them to the permutahedron of type A_n and B_n…
Let $p$ be a prime number. Every two-variable polynomial $f(x_1, x_2)$ over a finite field of characteristic $p$ defines an Artin--Schreier--Witt tower of surfaces whose Galois group is isomorphic to $\mathbb Z_p$. Our goal of this paper is…
The combinatorial mutation of polygons, which transforms a given lattice polygon into another one, is an important operation to understand mirror partners for two-dimensional Fano manifolds, and the mutation-equivalent polygons give…