English
Related papers

Related papers: Dimers, networks, and cluster integrable systems

200 papers

In this paper, we give a new completion for quasi-uniform spaces which generalizes the completion theories of Doitchinov [8] and Stoltenberg [20]. The presented completion theory is very well-behaved and extends the completion theory of…

General Topology · Mathematics 2020-09-02 Athanasios Andrikopoulos , Ioannis Gounaridis

In this article we use the cluster structure on the Grassmannian and the combinatorics of plabic graphs to exhibit a new aspect of mirror symmetry for Grassmannians in terms of polytopes. For our $A$-model, we consider the Grassmannian…

Algebraic Geometry · Mathematics 2017-12-06 Konstanze Rietsch , Lauren Williams

Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating the partition function of edge-weighted matchings in a bipartite graph.…

Discrete Mathematics · Computer Science 2021-06-25 Martin Dyer , Mark Jerrum , Haiko Muller , Kristina Vuskovic

Affine cluster varieties are covered up to codimension 2 by open algebraic tori. We put forth a general conjecture (based on earlier conversation between Vivek Shende and the last author) characterizing their deep locus, i.e. the complement…

Algebraic Geometry · Mathematics 2024-03-06 Marco Castronovo , Mikhail Gorsky , José Simental , David E Speyer

We introduce the notion of dual perfect bases and dual perfect graphs. We show that every integrable highest weight module $V_q(\lambda)$ over a quantum generalized Kac-Moody algebra $U_{q}(\mathcal{g})$ has a dual perfect basis and its…

Representation Theory · Mathematics 2014-05-09 Byeong Hoon Kahng , Seok-Jin Kang , Masaki Kashiwara , Uhi Rinn Suh

Let $m_G$ denote the number of perfect matchings of the graph $G$. We introduce a number of combinatorial tools for determining the parity of $m_G$ and giving a lower bound on the power of 2 dividing $m_G$. In particular, we introduce…

Combinatorics · Mathematics 2021-12-16 Grant T. Barkley , Ricky Ini Liu

Let $G=(V,E)$ be a graph and let $A_G$ be the clique-vertex incidence matrix of $G$. It is well known that $G$ is perfect iff the system $A_{_G}\mathbf x\le \mathbf 1$, $\mathbf x\ge\mathbf0$ is totally dual integral (TDI). In 1982, Cameron…

Combinatorics · Mathematics 2016-08-18 Guoli Ding , Wenan Zang , Qiulan Zhao

Linde, Moore, and Nordahl introduced a generalisation of the honeycomb dimer model to higher dimensions. The purpose of this article is to describe a number of structural properties of this generalised model. First, it is shown that the…

Probability · Mathematics 2021-03-30 Piet Lammers

(This is a report for the Proceedings of ``Journees Relativistes 1993'' written in September 1993. Containes a short description of the results published elsewhere in the joint paper with A. Ashtekar) Integral calculus on the space of gauge…

General Relativity and Quantum Cosmology · Physics 2011-04-15 Jerzy Lewandowski

Dimer coverings (or perfect matchings) of a finite graph are classical objects of graph theory appearing in the study of exactly solvable models of statistical mechanics. We introduce more general dimer labelings which form a topological…

Geometric Topology · Mathematics 2012-11-30 Vladimir Turaev

We show that if a non-amenable, quasi-transitive, unimodular graph $G$ has all degrees even then it has a factor-of-iid balanced orientation, meaning each vertex has equal in- and outdegree. This result involves extending earlier…

Probability · Mathematics 2023-08-15 Ferenc Bencs , Aranka Hrušková , László Márton Tóth

We say that a (di)graph $G$ has a perfect $H$-packing if there exists a set of vertex-disjoint copies of $H$ which cover all the vertices in $G$. The seminal Hajnal--Szemer\'edi theorem characterises the minimum degree that ensures a graph…

Combinatorics · Mathematics 2015-01-27 Andrew Treglown

This paper investigates the geometry of a completely integrable gradient system defined on the three parameter bivariate beta statistical manifold of the first kind. We prove that the associated vector field is Hamiltonian and admits a Lax…

Differential Geometry · Mathematics 2025-08-07 Prosper Rosaire Mama Assandje , Joseph Dongho , Thomas Bouetou Bouetou

In the limit of the lattice spacing going to zero, we consider the dimer model on isoradial graphs in the presence of singular $SL(N,\mathbb{C})$ gauge fields flat away from a set of punctures. We consider the cluster expansion of this…

High Energy Physics - Theory · Physics 2023-10-26 Sri Tata

We show that any quantum density matrix can be represented by a Bayesian network (a directed acyclic graph), and also by a Markov network (an undirected graph). We show that any Bayesian or Markov net that represents a density matrix, is…

Quantum Physics · Physics 2007-05-23 Robert R. Tucci

We propose efficient algorithms for two key tasks in the analysis of large nonuniform networks: uniform node sampling and cluster detection. Our sampling technique is based on augmenting a simple, but slowly mixing uniform MCMC sampler with…

Disordered Systems and Neural Networks · Physics 2007-05-23 Pekka Orponen , Satu Elisa Schaeffer

This paper is devoted to the construction of norm-preserving maps between bounded cohomology groups. For a graph of groups with amenable edge groups we construct an isometric embedding of the direct sum of the bounded cohomology of the…

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…

Combinatorics · Mathematics 2025-07-16 Jonah Berggren , Khrystyna Serhiyenko

We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…

Quantum Physics · Physics 2013-05-30 V. Karimipour , M. H. Zarei

For a planar directed graph G, Postnikov's boundary measurement map sends positive weight functions on the edges of G onto the appropriate totally nonnegative Grassmann cell. We establish an explicit formula for Postnikov's map by…

Combinatorics · Mathematics 2008-09-18 Kelli Talaska
‹ Prev 1 3 4 5 6 7 10 Next ›