Newton polygons for the non-bipartite dimer model

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…