Related papers: Higher Dimer Covers on Snake Graphs

In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…

Identifying frequent subgraphs, also called network motifs, is crucial in analyzing and predicting properties of real-world networks. However, finding large commonly-occurring motifs remains a challenging problem not only due to its NP-hard…

One can explicitly compute the generators of a surface cluster algebra either combinatorially, through dimer covers of snake graphs, or homologically, through the CC-map applied to indecomposable modules over the appropriate algebra. Recent…

There is a connection between *-representations of algebras associated with graphs and the problem about the spectrum of a sum of Hermitian operators (spectral problem). For algebras associated with extended Dynkin graphs we give an…

We study skew-symmetrizable cluster algebras $\mathcal{A}$ associated with unpunctured surfaces $\tilde{\mathbf{S}}$ endowed with an orientation-preserving involution $\sigma$. We give a geometric realization of such cluster algebras by…

Recently, W. M. Schmidt and L. Summerer developed a new theory called Parametric Geometry of Numbers which approximates the behaviour of the successive minima of a family of convex bodies in $\mathbb{R}^{n}$ related to the problem of…

We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with…

Proper continued fractions are generalized continued fractions with positive integer numerators $a_i$ and integer denominators with $b_i\geq a_i$. In this paper we study the strength of approximation of irrational numbers to their…

A dimer model is a quiver with faces embedded into a disk. A consistent dimer model gives rise to a strand diagram, and hence to a positroid. The Gorenstein-projective module category over the completed boundary algebra of a dimer model was…

The dimer model on a strip is considered as a Yang-Baxter \mbox{integrable} six vertex model at the free-fermion point with crossing parameter $\lambda=\tfrac{\pi}{2}$ and quantum group invariant boundary conditions. A one-to-many mapping…

We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…

This paper completes the comprehensive study of the dimer model on infinite minimal graphs with Fock's weights [arXiv:1503.00289] initiated in [arXiv:2007.14699]: the latter article dealt with the elliptic case, i.e., models whose…

- A hamiltonian graph $G$ verifying $e(G)>n(k-1)/2$ %with a vertex of degree greater or equal than $k$ contains any $k$-spider. - If $G$ is a graph with average degree $\bar{d} > k-1$, then every spider of size $k$ is contained in $G$ for…

The symmetric homology of a unital algebra $A$ over a commutative ground ring $k$ is defined using derived functors and the symmetric bar construction of Fiedorowicz. For a group ring $A = k[\Gamma]$, the symmetric homology is related to…

We show that spectral problems for periodic operators on lattices with embedded defects of lower dimensions can be solved with the help of matrix-valued integral continued fractions. While these continued fractions are usual in the…

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…

This is a sequel to the second and third author's Mixed Dimer Configuration Model in Type $D$ Cluster Algebras where we extend our model to work for quivers that contain oriented cycles. Namely, we extend a combinatorial model for…

The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained…

The dimer tiling problem asks in how many ways can the edges of a graph be covered by dimers so that each site is covered once. In the special case of a planar graph, this problem has a solution in terms of a free fermionic field theory. We…

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…