Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.07503

Newton polygons for the non-bipartite dimer model

Vladimir Bošković
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the dimer model on two families of non-bipartite graphs on a torus. The first family is obtained by replacing degree $3$ vertices in a bipartite torus graph with triangles, while the second consists of corner graphs associated with bipartite torus graphs. We determine the relationship between the Newton polygons of these graphs and those of the underlying bipartite graphs. We also identify the primitive edge vectors of the Newton polygons with the homology classes of the zig-zag paths. We further consider the marginal polynomials obtained by restricting to monomials corresponding to a boundary side of the Newton polygon. For the triangular lattice and the Fisher graph of the hexagonal lattice, we prove that these polynomials are real-rooted and obtain an explicit factorization of their roots. Finally, we introduce new local moves, including a move on non-planar graphs, that preserve the dimer partition functions up to a scale.

Explore related subjects

math.COmath-phmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vladimir Bošković. 2026-07-08. Newton polygons for the non-bipartite dimer model. https://arxiv.org/abs/2607.07503

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗