Related papers: Squareness for the Monopole-Dimer model
Absence of (complex) zeros property is at the heart of the interpolation method developed by Barvinok \cite{barvinok2017combinatorics} for designing deterministic approximation algorithms for various graph counting and computing partition…
We study a model of fully-packed dimer configurations (or perfect matchings) on a bipartite periodic graph that is two-dimensional but not planar. The graph is obtained from $\mathbb Z^2$ via the addition of an extensive number of extra…
A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…
A graph is called $t$-perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise $P_5$-free $t$-perfect graphs in terms of forbidden $t$-minors. Moreover, we show that $P_5$-free…
In the context of integrable partial difference equations on quad-graphs, we introduce the notion of open boundary reductions as a new means to construct discrete integrable mappings and their invariants. This represents an alternative to…
We study asymptotic limit of random pure dimer coverings on rail yardgraphs when the mesh sizes of the graphs go to 0. Each pure dimer covering correspondsto a sequence of interlacing partitions starting with an empty partition and ending…
Based on a technique of Barvinok and Barvinok and Sober\'on we identify a class of edge-coloring models whose partition functions do not evaluate to zero on bounded degree graphs. Subsequently we give a quasi-polynomial time approximation…
An analogue of the total variation prior for the normal vector field along the boundary of piecewise flat shapes in 3D is introduced. A major class of examples are triangulated surfaces as they occur for instance in finite element…
We show that a smooth radially symmetric solution $u$ to the graphic Willmore surface equation is either a constant or the defining function of a half sphere in ${\mathbb R}^3$. In particular, radially symmetric entire Willmore graphs in…
In this paper, in addition to the earlier introduced involutive divisions, we consider a new class of divisions induced by admissible monomial orderings. We prove that these divisions are noetherian and constructive. Thereby each of them…
Let $G$ be a finite group and $\chi: G \rightarrow \mathbb{C}$ a class function. Let $H = (V,E)$ be a directed graph with for each vertex a cyclic order of the edges incident to it. The cyclic orders give a collection $F$ of faces of $H$.…
Given a bipartite graph that has a perfect matching, a prefect proportional allocation is an assignment of positive weights to the nodes of the right partition so that every left node is fractionally assigned to its neighbors in proportion…
Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…
We introduce the framework of discrete holomorphic functions on t-embeddings of weighted bipartite planar graphs; t-embeddings also appeared under the name Coulomb gauges in a recent paper arXiv:1810.05616. We argue that this framework is…
A dimer model is a quiver with faces embedded in a surface. We define and investigate notions of consistency for dimer models on general surfaces with boundary which restrict to well-studied consistency conditions in the disk and torus…
For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…
We study partition functions for the dimer model on families of finite graphs converging to infinite self-similar graphs and forming approximation sequences to certain well-known fractals. The graphs that we consider are provided by actions…
Determining if a symmetric function is Schur-positive is a prevalent and, in general, a notoriously difficult problem. In this paper we study the Schur-positivity of a family of symmetric functions. Given a partition \lambda, we denote by…
In this work we study the variational problem associated to dimer models, a class of models from integrable probability and statistical mechanics in dimension two which have been the focus of intense research efforts over the last decades.…
Every finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which…