Related papers: Dimers, networks, and cluster integrable systems
We review several constructions of integrable systems with an underlying cluster algebra structure, in particular the Gekhtman-Shapiro-Tabachnikov-Vainshtein construction based on perfect networks and the Goncharov-Kenyon approach based on…
We show that the dimer model on a bipartite graph on a torus gives rise to a quantum integrable system of special type - a cluster integrable system. The phase space of the classical system contains, as an open dense subset, the moduli…
We introduce twisted triple crossing diagram maps, collections of points in projective space associated to bipartite graphs on the cylinder, and use them to provide geometric realizations of the cluster integrable systems of Goncharov and…
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…
Associated to a convex integral polygon $N$ in the plane are two integrable systems: the cluster integrable system of Goncharov and Kenyon, constructed from the dimer model on bipartite torus graphs, and the Beauville integrable system…
We describe a class of integrable systems on Poisson submanifolds of the affine Poisson-Lie groups $\widehat{PGL}(N)$, which can be enumerated by cyclically irreducible elements the co-extended affine Weyl groups $(\widehat{W}\times…
The pentagram map that associates to a projective polygon a new one formed by intersections of short diagonals was introduced by R. Schwartz and was shown to be integrable by V. Ovsienko, R. Schwartz and S. Tabachnikov. Recently, M. Glick…
We formulate a higher-rank version of the boundary measurement map for weighted planar bipartite networks in the disk. It sends a network to a linear combination of SL$_r$-webs, and is built upon the r-fold dimer model on the network. When…
Amalgamation in the totally non-negative part of positroid varieties is equivalent to gluing copies of $Gr^{TP}(1,3)$ and $Gr^{TP}(2,3)$. Lam has proposed to represent amalgamation in positroid varieties by equivalence classes of relations…
A perfect matching in a bipartite graph embedded on a torus defines a height function on the graph's faces and an associated height change vector in $\Z^2$. These matchings are enumerated by a combination of four evaluations of a bivariate…
As an improvement of the combinatorial realization of totally positive matrices via the essential positive weightings of certain planar network by S.Fomin and A.Zelevisky \cite{[4]}, in this paper, we give the test method of positive…
We study a discrete dynamic on weighted bipartite graphs on a torus, analogous to dimer integrable systems in Goncharov-Kenyon 2013. The dynamic on the graph is an urban renewal together with shrinking all 2-valent vertices, while it is a…
The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph $G$ is said to be $n$-rotation symmetric if the cyclic group of order $n$ is a subgroup of the…
The homogeneous coordinate ring of the Grassmannian Gr(k,n) has a cluster structure defined in terms of planar diagrams known as Postnikov diagrams. The cluster corresponding to such a diagram consists entirely of Pluecker coordinates. We…
The set of perfect matchings of a connected bipartite plane graph $G$ has the structure of a distributive lattice, as shown by Propp, where the partial order is induced by the height of a matching. In this article, our focus is the dimer…
We show that the dimer algebra of a connected Postnikov diagram in the disc is bimodule internally 3-Calabi-Yau in the sense of the author's earlier work. As a consequence, we obtain an additive categorification of the cluster algebra…
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…
We show that when two toric Calabi-Yau 3-folds and their corresponding toric varieties are related by a birational transformation, they are associated with a pair of dimer models on the 2-torus that define dimer integrable systems, which…
In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a…
The Zykov ring of signed finite simple graphs with topological join as addition and compatible multiplication is an integral domain but not a unique factorization domain. We know that because by taking graph complements, it becomes…