Related papers: Squareness for the Monopole-Dimer model
We consider the monomer-dimer model on sequences of random graphs locally convergent to trees. We prove that the monomer density converges almost surely, in the thermodynamic limit, to an analytic function of the monomer activity. We…
Working with Lieb's transfer matrix for the dimer model, we point out that the full set of dimer configurations may be partitioned into disjoint subsets (sectors) closed under the action of the transfer matrix. These sectors are labelled by…
Folding is emerging as a promising manufacturing process to transform flat materials into functional structures, offering efficiency by reducing the need for welding, gluing, and molding, while minimizing waste and enabling automation.…
The dimer model is a classical statistical mechanics model which is exactly solvable in two dimensions, but about which little is known in higher dimensions. In analogy with large $N$ limits in lattice gauge theory, we study a large $N$…
In this paper, we derive a set of equivalent conditions for the zero-divisor graph $\Gamma(Q)$ of a poset $Q$ with $0$ to be complemented, characterizing it in terms of quasi-complemented posets. Furthermore, we prove that the notions of a…
We propose a modification of the Skyrme model that supports a self-dual sector possessing exact non-trivial finite energy solutions. The action of such a theory possesses the usual quadratic and quartic terms in field derivatives, but the…
We consider the complexity of counting weighted graph homomorphisms defined by a symmetric matrix $A$. Each symmetric matrix $A$ defines a graph homomorphism function $Z_A(\cdot)$, also known as the partition function. Dyer and Greenhill…
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 propose a geometric counterpart of the dimer model on bipartite graphs. A state of our model consists of a choice of a point for each white vertex and hyperplane for each black vertex. This data is subject to certain conditions…
In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set's zeros. We generalize the squarefree decomposition of univariate polynomials to the so-called pseudo squarefree decomposition…
Given a symmetric matrix $M\in \{0,1,*\}^{D\times D}$, an $M$-partition of a graph $G$ is a function from $V(G)$ to $D$ such that no edge of $G$ is mapped to a $0$ of $M$ and no non-edge to a $1$. We give a computer-assisted proof that,…
In this paper, we consider an extended Kazakov-Migdal model defined on an arbitrary graph. The partition function of the model, which is expressed as the summation of all Wilson loops on the graph, turns out to be represented by the…
Cluster algebra structures for Grassmannians and their (open) positroid strata are controlled by a Postnikov diagram D or, equivalently, a dimer model on the disc, as encoded by either a bipartite graph or the dual quiver (with faces). The…
In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-complete even when restricted to bipartite graphs. It has been…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
Let $G$ be a graph, a dominating induced matching (DIM) of $G$ is an induced matching that dominates every edge of $G$. In this paper we show that if a graph $G$ has a DIM, then $\chi(G) \leqslant 3$. Also, it is shown that if $G$ is a…
The zeros of the size-$n$ partition functions for a statistical mechanical model can be used to help understand the critical behaviour of the model as $n\to\infty$. Here we use weighted Dyck paths as a simple model of two-dimensional…
An irreducible element of a commutative ring is absolutely irreducible if no power of it has more than one (essentially different) factorization into irreducibles. In the case of the ring $\text{Int}(D)=\{f\in K[x]\mid f(D)\subseteq D\}$,…
We propose the Kazakov-Migdal model on graphs and show that, when the parameters of this model are appropriately tuned, the partition function is represented by the unitary matrix integral of an extended Ihara zeta function, which has a…
We study close-packed dimers on the quasiperiodic Ammann-Beenker (AB) graph, that was recently shown to have the unusual feature that hard-core dimer constraints are exactly reproduced at successive discrete length scales. This observation…