Related papers: Dimers on graphs in non-orientable surfaces

Some properties of non-orientable 3-manifolds are shown. The semi-group of cobordism of immersions of surfaces in such manifolds is computed and proven actually to be a group. Explicit invariants are provided.

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…

Partial duality generalizes the fundamental concept of the geometric dual of an embedded graph. A partial dual is obtained by forming the geometric dual with respect to only a subset of edges. While geometric duality preserves the genus of…

We prove that the values of discrete directed polymer partition functions involving multiple non-intersecting paths remain invariant under replacing the background weights by their images under the geometric RSK correspondence. This result…

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…

This study proposes an algorithm for modeling compressible flows in spherical shells in nearly incompressible and weakly compressible regimes based on an implicit direction splitting approach. The method retains theoretically expected…

A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…

We consider a numerical approach for the incompressible surface Navier-Stokes equation on surfaces with arbitrary genus $g(\mathcal{S})$. The approach is based on a reformulation of the equation in Cartesian coordinates of the embedding…

We investigate a cancellation property satisfied by a connected Eulerian digraph $D$. Namely, unless $D$ is a single directed cycle, we have $\sum_{k\geq 1} (-1)^{k} f_k(D)=0$, where $f_k(D)$ is the number of partitions of Eulerian circuits…

Let $D$ be a directed graph cellularly embedded in a surface together with non-negative cost on its arcs. Given any integer circulation in $D$, we study the problem of finding a minimum-cost non-negative integer circulation in $D$ that is…

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…

Let $\varphi:F_1\to F_2$ be an injective morphism of free groups. If $\varphi$ is geometric (i.e. induced by an inclusion of oriented compact connected surfaces with nonempty boundary), then we show that $\varphi$ is an isometric embedding…

We consider the minimum-cut partitioning of a graph into more than two parts using spectral methods. While there exist well-established spectral algorithms for this problem that give good results, they have traditionally not been well…

The present paper provides a method for finding partial differential equations satisfied by the Feynman integrals for diagrams of various types, using the Griffiths theorem on the reduction of poles of rational differential forms. As an…

Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components.…

In this paper we obtain a splitting theorem for the symmetric diffusion operator $\Delta_\phi=\Delta-\left<\nabla\phi,\nabla \right>$ and a non-constant $C^3$ function $f$ in a complete Riemannian manifold $M$, under the assumptions that…

In the final paper of the Graph Minors series N. Robertson and P. Seymour proved that graphs are well-quasi-ordered under the immersion ordering. A direct implication of this theorem is that each class of graphs that is closed under taking…

The dimer model is the study of random dimer covers (perfect matchings) of a graph. A double-dimer configuration on a graph $G$ is a union of two dimer covers of $G$. We introduce quaternion weights in the dimer model and show how they can…

Given an affine transformation $T$, we define its Fisher distortion $Dist_F(T)$. We show that the Fisher distortion has Riemannian metric structure and provide an algorithm for finding mean distorting transformation -- namely -- for a given…

This short note modifies a reconstruction method by the author (Comm. PDE, 45(9):1118-1133, 2020), for reconstructing piecewise constant conductivities in the Calder\'on problem (electrical impedance tomography). In the former paper, a…