Related papers: Higher Dimer Covers on Snake Graphs
This note relates topics in statistical mechanics, graph theory and combinatorics, lattice quantum field theory, super quantum mechanics and string theory. We give a precise relation between the dimer model on a graph embedded on a torus…
We construct a class of lattices in three and higher dimensions for which the number of dimer coverings can be determined exactly using elementary arguments. These lattices are a generalization of the two-dimensional kagome lattice, and the…
This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts increasing the coverage are accepted. A finite system eventually gets congested, and we study the statistics of congested…
The non-perturbative constraints imposed by intrinsic fermionic non-invertible symmetries in 1+1 dimensional gapped systems remain largely unexplored. In this letter, we propose the superstrip algebra as a unified framework to catalog the…
The present paper opens a new branch in the theory of variational problems with branching extremals, the investigation of one-dimensional minimal fillings of finite pseudo-metric spaces. On the one hand, this problem is a one-dimensional…
A graph is $k$-connected if it has $k$ internally-disjoint paths between every pair of nodes. A subset $S$ of nodes in a graph $G$ is a $k$-connected set if the subgraph $G[S]$ induced by $S$ is $k$-connected; $S$ is an $m$-dominating set…
We use the Schmidt Subspace Theorem to establish the transcendence of a class of quasi-periodic continued fractions. This improves earlier works of Maillet and of A. Baker. We also improve an old result of Davenport and Roth on the rate of…
We give a complete description of the genus expansion of the one-cut solution to the generalized Penner model. The solution is presented in a form which allows us in a very straightforward manner to localize critical points and to…
In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph $G$, called the sub-$k$-domination number and denoted $sub_k(G)$. We show that $sub_k(G)$ is a computationally efficient sharp lower…
The classical dimer model is concerned with the (weighted) enumeration of perfect matchings of a graph. An $n$-dimer cover is a multiset of edges that can be realized as the disjoint union of $n$ individual matchings. For a probability…
Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…
The Spectral Problem is to describe possible spectra $\sigma (A_j)$ for an irreducible $n$-tuple of Hermitian operators s.t. $A_1+...+A_n$ is a scalar operator. In case when $m_j= | \sigma (A_j)|$ are finite and a rooted tree ${\rm…
We show that the dominating set problem admits a constant factor approximation in a constant number of rounds in the LOCAL model of distributed computing on graph classes with bounded expansion. This generalizes a result of Czygrinow et al.…
Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…
Given a metric space $(X,d_X)$, a $(\beta,s,\Delta)$-sparse cover is a collection of clusters $\mathcal{C}\subseteq P(X)$ with diameter at most $\Delta$, such that for every point $x\in X$, the ball $B_X(x,\frac\Delta\beta)$ is fully…
In this article, we show that the algorithm of maintaining expander decompositions in graphs undergoing edge deletions directly by removing sparse cuts repeatedly can be made efficient. Formally, for an $m$-edge undirected graph $G$, we say…
A $t$-spanner of an undirected $n$-vertex graph $G$ is a sparse subgraph $H$ of $G$ that preserves all pairwise distances between its vertices to within multiplicative factor $t$, also called the \emph{stretch}. We investigate the problem…
An operation on species corresponding to the inner plethysm of their associated cycle index series is constructed. This operation, the inner plethysm of species, is generalized to n-sorted species. Polynomial maps on species are studied and…
In this paper we study functions on the interval that have the same persistent homology. By introducing an equivalence relation modeled after topological conjugacy, which we call graph-equivalence, a precise enumeration of functions with…