相关论文: A Reciprocity Theorem for Monomer-Dimer Coverings

Selfridge asked to investigate the pairs $(m,n)$ of natural numbers for which $2^m - 2^n$ divides $x^m - x^n$ for all integers $x.$ This question was answered by different mathematicians by showing that there are only finitely many such…

We study the classical dimer model on rhombic Penrose tilings, whose edges and vertices may be identified with those of a bipartite graph. We find that Penrose tilings do not admit perfect matchings (defect-free dimer coverings). Instead,…

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…

We study a generalisation of the double-dimer model that encompasses several models of interest, including the monomer double-dimer model, spatial random permutations, the dimer model, and the spin $O(N)$ model, and which is also related to…

Snake graphs are a class of planar graphs that are important in the theory of cluster algebras. Indeed, the Laurent expansions of the cluster variables in cluster algebras from surfaces are given as weight generating functions for 1-dimer…

Let $N(m,n)$ denote the number of partitions of $n$ with rank $m$, and let $M(m,n)$ denote the number of partitions of $n$ with crank $m$. Chan and Mao proved that for any nonnegative integers $m$ and $n$, $N(m,n)\geq N(m+2,n)$ and for any…

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

We study the Folklore set of Dirichlet improvable matrices in $\mathbb R^{m\times n}$ which are neither singular nor badly approximable. We prove the non-emptiness for all positive integer pairs $m,n$ apart from $\{m,n\}=\{ 1,1\}$ and…

Fix $c\in (0,1)$ and let $\Gamma$ be a $\lfloor c n\rfloor$-regular digraph on $n$ vertices drawn uniformly at random. We prove that when $n$ is large, the (non-symmetric) adjacency matrix $M$ of $\Gamma$ is invertible with high…

By considering the tiling of an $N$-board (a linear array of $N$ square cells of unit width) with new types of tile that we refer to as combs, we give a combinatorial interpretation of the product of two consecutive generalized Fibonacci…

Consider the family of all perfect matchings of the complete graph $K_{2n}$ with $2n$ vertices. Given any collection $\mathcal M$ of perfect matchings of size $s$, there exists a maximum number $f(n,x)$ such that if $s\leq f(n,x)$, then…

The open string sector of the topological B-model model on CY $(m+2)$-folds is described by $m$-graded quivers with superpotentials. This correspondence extends to general $m$ the well known connection between CY $(m+2)$-folds and gauge…

We consider a one-dimensional continuous (Kronig-Penney) extension of the (tight-binding) Random Dimer model of Dunlap et al. [Phys. Rev. Lett. 65, 88 (1990)]. We predict that the continuous model has infinitely many resonances (zeroes of…

The correlation of gaps in dimer systems was introduced in 1963 by Fisher and Stephenson, who looked at the interaction of two monomers generated by the rigid exclusion of dimers on the closely packed square lattice. In previous work we…

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…

For $m,n \in \mathbb{N}$, $m\geq 1$ and a given function $f : \mathbb{R}^m\longrightarrow \mathbb{R}$, the polynomial interpolation problem (PIP) is to determine a unisolvent node set $P_{m,n} \subseteq \mathbb{R}^m$ of…

Letting $\delta_1(n,m)$ be the density of the set of integers with exactly one divisor in $(n,m)$, Erd\H{o}s wondered if $\delta_1(n,m)$ is unimodular for fixed $n$. We prove this is false in general, as the sequence $(\delta_1(n,m))$ has…

In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For…

We solve the monomer-dimer problem on a non-bipartite lattice, the simple quartic lattice with cylindrical boundary conditions, with a single monomer residing on the boundary. Due to the non-bipartite nature of the lattice, the well-known…

Given a coprime pair $(m,n)$ of positive integers, rational Catalan numbers $\frac{1}{m+n} \binom{m+n}{m,n}$ counts two combinatorial objects:rational $(m,n)$-Dyck paths are lattice paths in the $m\times n$ rectangle that never go below the…