Related papers: Higher Dimer Covers on Snake Graphs
In this note, we give a closed formula for the partition function of the dimer model living on a (2 x n) strip of squares or hexagons on the torus for arbitrary even n. The result is derived in two ways, by using a Potts model like…
Clustering is an important topic in algorithms, and has a number of applications in machine learning, computer vision, statistics, and several other research disciplines. Traditional objectives of graph clustering are to find clusters with…
In the past three decades, the study of rhombus tilings and domino tilings of various plane regions has been a thriving subfield of enumerative combinatorics. Physicists classify such work as the study of dimer covers of finite graphs. In…
In the Dominated Cluster Deletion problem, we are given an undirected graph $G$ and integers $k$ and $d$ and the question is to decide whether there exists a set of at most $k$ vertices whose removal results in a graph in which each…
The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…
The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…
For a set $S$ of vertices of a graph $G$, we define its density $0 \leq \sigma(S) \leq 1$ as the ratio of the number of edges of $G$ spanned by the vertices of $S$ to ${|S| \choose 2}$. We show that, given a graph $G$ with $n$ vertices and…
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…
Hermitian symplectic spaces provide a natural framework for the extension theory of symmetric operators. Here we show that hermitian symplectic spaces may also be used to describe the solution to the factorisation problem for the scattering…
Series solutions for a large family of single equation Dyson-Schwinger equations are given as expansions over decorated rooted connected chord diagrams. The analytic input to the new expansions are the expansions of the regularized…
The Symmetries of Feynman Integrals (SFI) method is extended for the first time to incorporate an irreducible numerator. This is done in the context of the so-called vacuum and propagator seagull diagrams, which have 3 and 2 loops,…
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a…
This paper establishes a connection between binary subwords and perfect matchings of a snake graph, an important tool in the theory of cluster algebras. Every binary expansion w can be associated to a piecewise-linear poset P and a snake…
This paper introduces an efficient algorithm for persistence diagram computation, given an input piecewise linear scalar field $f$ defined on a $d$-dimensional simplicial complex $K$, with $d \leq 3$. Our work revisits the seminal algorithm…
We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…
In recent works, [20],[21], descendent integrals on the moduli space of Riemann surfaces with boundary were defined. It was conjectured in [20] that the generating function of these integrals satisfies the open KdV equations. In this paper…
Motivated by recent applications of dominator computations, we consider the problem of dynamically maintaining the dominators of flow graphs through a sequence of insertions and deletions of edges. Our main theoretical contribution is a…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…
In this paper, the second of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs has girth tending to infinity, then the maximal coarse Baum-Connes assembly map is an…