Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2402.02784

A gluing operation for dimer quivers

Karin Baur·Colin Krawchuk
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this article we introduce a gluing operation on dimer models. This allows us to construct dimer quivers on arbitrary surfaces. We study how the associated dimer and boundary algebras behave under the gluing and how to determine them from the gluing components. We also use this operation to construct homogeneous dimer quivers on annuli.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Karin Baur, Colin Krawchuk. 2024-02-05. A gluing operation for dimer quivers. https://doi.org/10.1017/s0017089526100974

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the Hamiltonicity, traceability and toughness of complements of line graphs

A coline graph $\text{co}(G)$ of a graph $G$ is the graph with vertex set $E(G)$ for which two vertices $e$ and $e'$ of $\text{co}(G)$ are adjacent if and only if they are not adjacent as edges in $G$. A graph $G$ is tough if the number of connected components of $G-S$ is at most $|S|$ for all cut sets $S$. Wu and Meng, and Liu independently gave similar characterisations of coline graphs that are Hamiltonian. In this paper we give an alternate proof of Wu and Meng's and Liu's results using the longest cycle method. We in fact prove the following reformulation of their results. A tough coline graph $\text{co}(G)$ is Hamiltonian unless $G$ is one of four examples, one of which is $K_5$, since $\text{co}(K_5)$ is the Petersen graph. Characterisations of tough coline graphs and of coline graphs that contain a Hamiltonian path are also given.

math.CO↗
arXiv2026

Deficit bounds and equality cases in the Tu--Deng problem

Let $N=2^k-1$, and let $S_{t,k}$ consist of the pairs $0\le a,b<N$ such that $a+b\equiv t\pmod N$ and $\wt(a)+\wt(b)<k$. The Tu--Deng bound $|S_{t,k}|\le 2^{k-1}$ has recently been proved. In this paper, we give a combinatorial proof of the equality criterion. If the $k$-bit cyclic word of $t$ has $Z$ zeros and $g_1,\ldots,g_Z$ are the numbers of ones between successive zeros, then $$|S_{t,k}|=2^{k-1} \quad\Longleftrightarrow\quad g_i\ge Z-1\quad(1\le i\le Z).$$ Moreover, we recover the resulting enumeration of the equality parameters. Beyond equality, if $R\ge Z\ge2$, where $R$ is the number of ones, then every nonequality parameter satisfies $$2^{k-1}-|S_{t,k}|\ge 2^{R-Z+1},$$ and we classify all cases in which this bound is attained. For $R<Z$ we obtain a congruence for $|S_{t,k}|$ and a lower bound for the deficit in terms of the number of cyclic runs of ones.

math.CO↗
arXiv2026

An Improvement to the Upper Bound for Marton's Covering Conjecture

Marton's covering conjecture studies finite sets in high-dimensional binary spaces whose pairwise sums create relatively few new elements. It predicts that every such set can be described efficiently by shifted copies of one linear subspace of comparable size. Gowers, Green, Manners, and Tao [GGMT25] proved the conjecture with exponent $12$. Liao [L24] improved the exponent to $9$. We improve it further to $5.287$.

math.CO↗