Related papers: Dimers on graphs in non-orientable surfaces
The aim of this monograph is twofold: to explain various nonautonomous integrable systems (discrete Painlev\'e all the way up to the elliptic level, as well as generalizations \`a la Garnier) using an interpretation of difference and…
We present a general purpose method for solving partial differential equations on a closed surface, based on a technique for discretizing the surface introduced by Wenjun Ying and Wei-Cheng Wang [J. Comput. Phys. 252 (2013), pp. 606-624]…
Consider a surface $\Sigma$ with punctures that serve as marked points and at least one marked point on each boundary component. We build a filling surface $\Sigma_n$ by singling out one of the boundary components and denoting by $n$ the…
Let M be a complete n-dimensional Riemannian spin manifold, partitioned by q two-sided hypersurfaces which have a compact transverse intersection N and which in addition satisfy a certain coarse transversality condition. Let E be a…
This paper addresses the analysis and numerical assessment of a computational method for solving the Cahn--Hilliard equation defined on a surface. The proposed approach combines the stabilized trace finite element method for spatial…
A lamination of a graph embedded on a surface is a collection of pairwise disjoint non-contractible simple closed curves drawn on the graph. In the case when the surface is a sphere with three punctures (a.k.a. a pair of pants), we first…
Given a connected undirected weighted graph, we are concerned with problems related to partitioning the graph. First of all we look for the closest disconnected graph (the minimum cut problem), here with respect to the Euclidean norm. We…
After recalling the definition of Grassmann algebra and elements of Grassmann--Berezin calculus, we use the expression of Pfaffians as Grassmann integrals to generalize a series of formulas relating generating functions of paths in digraphs…
We construct a scattering theory for harmonic one-forms on Riemann surfaces, obtained from boundary value problems through systems of curves and the jump problem. We obtain an explicit expression for the scattering matrix in terms of…
This paper develops an algorithm that identifies and decomposes a median graph of a triangulation of a 2-dimensional (2D) oriented bordered surface and in addition restores all corresponding triangulation whenever they exist. The algorithm…
There is a Turing computable embedding $\Phi$ of directed graphs $A$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform interpretation; i.e., for all directed graphs $A$, these formulas interpret $A$ in…
We propose a graph-based sweep algorithm for solving the steady state, mono-energetic discrete ordinates on meshes of high-order curved mesh elements. Our spatial discretization consists of arbitrarily high-order discontinuous Galerkin…
Dimer models provide a method of constructing noncommutative crepant resolutions of affine toric Gorenstein threefolds. In homological mirror symmetry, they can also be used to describe noncommutative Landau--Ginzburg models dual to…
We solve the problem of a dimer moving on a spherical surface and find that its binding energy and wave function are sensitive to the total angular momentum. The dimer gets squeezed in the direction orthogonal to the center-of-mass motion…
The purpose of this note is to give a succinct summary of some basic properties of T-graphs which arise in the study of the dimer model. We focus in particular on the relation between the dimer model on the heaxgonal lattice with a given…
The chapter contains a detailed presentation of the surface integral theory for modelling light diffraction by surface-relief diffraction gratings having a one-dimensional periodicity. Several different approaches are presented, leading…
Graphene is a zero-gap semiconductor, where the electrons propagating inside are described by the ultra-relativistic Dirac equation normally reserved for very high energy massless particles. In this work, we show that graphene under a…
The strength of an atom-surface interaction is determined by studying atom diffraction from a rotated material grating. A phasor diagram is developed to interpret why diffraction orders are never completely suppressed when a complex…
This paper explores the application diffusion maps as graph shift operators in understanding the underlying geometry of graph signals. The study evaluates the improvements in graph learning when using diffusion map generated filters to the…
We show that for each fixed $k$, the problem of finding $k$ pairwise vertex-disjoint directed paths between given source-sink pairs in a planar directed graph is solvable in polynomial time. In fact, it suffices to fix the number of faces…