English
Related papers

Related papers: Dimer models on astroidal zig-zag graphs

200 papers

Vassiliev (finite type) invariants of knots can be described in terms of weight systems. These are functions on chord diagrams satisfying so-called 4-term relations. In the study of the sl2 weight system, it was shown that its value on a…

Combinatorics · Mathematics 2016-02-02 Sergey Lando , Vyacheslav Zhukov

We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is defined over a principal ideal domain, this is equivalent to…

Combinatorics · Mathematics 2007-05-23 Greg Kuperberg

In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex of graphs in terms of its dimension. We observe that the…

Combinatorics · Mathematics 2016-06-21 Penny Haxell , Lothar Narins , Tibor Szabó

Unit-vector fields $\nvec$ on a convex polyhedron $P$ subject to tangent boundary conditions provide a simple model of nematic liquid crystals in prototype bistable displays. The equilibrium and metastable configurations correspond to…

Mathematical Physics · Physics 2009-05-12 A Majumdar , JM Robbins , M Zyskin

Given a convex $n$-gon, we can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the undirected graph with…

Computational Geometry · Computer Science 2018-05-29 Luis H. Herrera , Pablo Pérez-Lantero

We continue the discussion of the fermion models on graphs that started in the first paper of the series. Here we introduce a Graphical Gauge Model (GGM) and show that : (a) it can be stated as an average/sum of a determinant defined on the…

Statistical Mechanics · Physics 2010-05-27 Vladimir Y. Chernyak , Michael Chertkov

The polarization tensor of graphene derived in the framework of the Dirac model using the methods of thermal quantum field theory in (2+1) dimensions is recast in a mathematically equivalent but more compact and convenient in computations…

Quantum Physics · Physics 2025-02-20 G. L. Klimchitskaya , C. C. Korikov , V. M. Mostepanenko

We study asymptotics of the dimer model on large toric graphs. Let $\mathbb L$ be a weighted $\mathbb{Z}^2$-periodic planar graph, and let $\mathbb{Z}^2 E$ be a large-index sublattice of $\mathbb{Z}^2$. For $\mathbb L$ bipartite we show…

Mathematical Physics · Physics 2015-11-11 Richard W. Kenyon , Nike Sun , David B. Wilson

We apply dimer diagram techniques to uncover discrete global symmetries in the fields theories on D3-branes at singularities given by general orbifolds of general toric Calabi-Yau threefold singularities. The discrete symmetries are…

High Energy Physics - Theory · Physics 2019-10-23 Eduardo García-Valdecasas , Alessandro Mininno , Angel M. Uranga

We present an application of the Grassmann algebra to the problem of the monomer-dimer statistics on a two-dimensional square lattice. The exact partition function, or total number of possible configurations, of a system of dimers with a…

Statistical Mechanics · Physics 2015-06-18 Nicolas Allegra , Jean-Yves Fortin

Random directed graphs $D(n,p)$ undergo a phase transition around the point $p = 1/n$, and the width of the transition window has been known since the works of Luczak and Seierstad. They have established that as $n \to \infty$ when $p = (1…

We study the spectral curves of dimer models on periodic Fisher graphs, obtained from a ferromagnetic Ising model on $\mathbb{Z}^2$. The spectral curve is defined by the zero locus of the determinant of a modified weighted adjacency matrix.…

Complex Variables · Mathematics 2012-04-13 Zhongyang Li

The monomer-dimer model is fundamental in statistical mechanics. However, it is $#P$-complete in computation, even for two dimensional problems. A formulation in matrix permanent for the partition function of the monomer-dimer model is…

Statistical Mechanics · Physics 2009-11-13 Yan Huo , Heng Liang , Si-Qi Liu , Fengshan Bai

This paper deals with the problem of detecting non-isotropic high-dimensional geometric structure in random graphs. Namely, we study a model of a random geometric graph in which vertices correspond to points generated randomly and…

Statistics Theory · Mathematics 2020-02-25 Ronen Eldan , Dan Mikulincer

We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…

Combinatorics · Mathematics 2020-10-26 R. Abiya , G. Ambika

The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. When restricted to graphs and their shortest paths metric, the asymptotic dimension can be seen as a large scale…

Combinatorics · Mathematics 2020-12-08 Marthe Bonamy , Nicolas Bousquet , Louis Esperet , Carla Groenland , François Pirot , Alex Scott

Isoradial graphs are a natural generalization of regular graphs which give, for many models of statistical mechanics, the right framework for studying models at criticality. In this survey paper, we first explain how isoradial graphs…

Probability · Mathematics 2010-12-16 Cédric Boutillier , Béatrice De Tilière

We introduce a new class of discrete approximations of planar domains that we call "hedgehog domains". In particular, this class of approximations contains two-step Aztec diamonds and similar shapes. We show that fluctuations of the height…

Mathematical Physics · Physics 2019-12-11 Marianna Russkikh

We define Poincar\'{e} profiles of Dirichlet type for graphs of bounded degree, in analogy with the Poincar\'{e} profiles (of Neumann type) defined in [HMT19]. The obvious first definition yields nothing of interest, but an alternative…

Group Theory · Mathematics 2019-10-16 David Hume

We define dual-critical graphs as graphs having an acyclic orientation, where the indegrees are odd except for the unique source. We have very limited knowledge about the complexity of dual-criticality testing. By the definition the problem…

Data Structures and Algorithms · Computer Science 2014-10-08 Zoltán Király , Sándor Kisfaludi-Bak