Related papers: A Pfaffian formula for the monomer-dimer model on …
We investigate theoretically the adhesion and electronic properties of graphene on a muscovite mica surface using the density functional theory (DFT) with van der Waals (vdW) interactions taken into account (the vdW-DF approach). We found…
We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic boundary conditions, i.e. a graph $\Gamma$ in the Klein bottle $K$. Let $\Gamma_{mn}$ denote the graph obtained by pasting $m$ rows and $n$…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…
We show that the number Z of q-edge-colourings of a simple regular graph of degree q is deducible from functions describing dimers on the same graph, viz. the dimer generating function or equivalently the set of connected dimer correlation…
We study the classical hard-core dimer model on the triangular lattice. Following Kasteleyn's fundamental theorem on planar graphs, this problem is soluble by Pfaffians. This model is particularly interesting for, unlike the dimer problems…
We prove a distributional limit theorem conjectured in [Journal of Statistical Physics 174, No. 6, 1372-1403 (2019)] for partition functions defining models of directed polymers on diamond hierarchical graphs with disorder variables placed…
Partition of unity methods (PUMs) on graphs represent straightforward and remarkably adaptable auxiliary techniques for graph signal processing. By relying solely on the intrinsic graph structure, we propose the generation of a partition of…
Multilinear embedding estimates for the fractional Laplacian are obtained in terms of functionals defined over a hyperbolic surface. Convolution estimates used in the proof enlarge the classical framework of the convolution algebra for…
We study various mathematical aspects of discrete models on graphs, specifically the Dimer and the Ising models. We focus on proving gluing formulas for individual summands of the partition function. We also obtain partial results regarding…
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
Let $\Gamma$ be a graph equipped with a Markov operator $P$. We introduce discrete fractional Littlewood-Paley square functionals and prove their $L^p$-boundedness under various geometric assumptions on $\Gamma$.
This paper is the first in the series devoted to evaluation of the partition function in statistical models on graphs with loops in terms of the Berezin/fermion integrals. The paper focuses on a representation of the determinant of a square…
We prove the Pfaffian Sign Theorem for the dimer model on a triangular lattice embedded in the torus. More specifically, we prove that the Pfaffian of the Kasteleyn periodic-periodic matrix is negative, while the Pfaffians of the Kasteleyn…
The article starts with some introductory material about resolution graphs of normal surface singularities (definitions, topological/homological properties, etc). We then discuss the case when the normal surface singularity is an N-fold…
We develop the partitioning technique for quantum discrete systems. The graph consists of several subgraphs: a central graph and several branch graphs, with each branch graph being rooted by an individual node on the central one. We show…
Let \Sigma be a minimal submanifold of \R^{n+m} that can be represented as the graph of a smooth map f:\R^n-->\R^m. We apply a formula we derived in the study of mean curvature flow to obtain conditions under which \Sigma must be an affine…
The study of graph drawings on 2-surfaces is an active area of mathematical research. Our main results are criteria for integer and modulo 2 embeddability of graphs to surfaces.
In this paper we present a new approach for tightening upper bounds on the partition function. Our upper bounds are based on fractional covering bounds on the entropy function, and result in a concave program to compute these bounds and a…
Let $f\in W^{3,1}_{\mathrm{loc}}(\Omega)$ be a function defined on a connected open subset $\Omega\subseteq\mathbb R^2$. We will show that its graph is contained in a quadratic surface if and only if $f$ is a weak solution to a certain…
We resolve in the affirmative conjectures of Repovs and A. Skopenkov (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our…