# The Laplacian and Dirac operators on critical planar graphs

@article{Kenyon2002TheLA,
title={The Laplacian and Dirac operators on critical planar graphs},
author={Richard W. Kenyon},
journal={Inventiones mathematicae},
year={2002},
volume={150},
pages={409-439}
}
• R. Kenyon
• Published 2002
• Mathematics, Physics
• Inventiones mathematicae
Abstract.On a periodic planar graph whose edge weights satisfy a certain simple geometric condition, the discrete Laplacian and Dirac operators have the property that their determinants and inverses only depend on the local geometry of the graph. We obtain explicit expressions for the logarithms of the (normalized) determinants, as well as the inverses of these operators. We relate the logarithm of the determinants to the volume plus mean curvature of an associated hyperbolic ideal polyhedron… Expand
The Discrete Green’s Function
We first discuss discrete holomorphic functions on quad-graphs and their relation to discrete harmonic functions on planar graphs. Then, the special weights in the discrete Cauchy-Riemann (andExpand
• Mathematics, Physics
• 2019
In the first part of the paper, we classify linear integrable (multi-dimensionally consistent) quad-equations on bipartite isoradial quad-graphs in $\mathbb C$, enjoying natural symmetries and theExpand
Discrete complex analysis on planar quad-graphs
• Mathematics
• 2016
We develop further a linear theory of discrete complex analysis on general quad-graphs, extending previous work of Duffin, Mercat, Kenyon, Chelkak and Smirnov on discrete complex analysis on rhombicExpand
Asymptotics of Height Change on Toroidal Temperleyan Dimer Models
• Mathematics
• 2014
The dimer model is an exactly solvable model of planar statistical mechanics. In its critical phase, various aspects of its scaling limit are known to be described by the Gaussian free field. ForExpand
Asymptotic Determinant of Discrete Laplace-Beltrami Operators
We study combinatorial Laplacians on rectangular subgraphs of $\epsilon \mathbb{Z}^2$ that approximate Laplace-Beltrami operators of Riemannian metrics as $\epsilon \rightarrow 0$. TheseExpand
Discrete holomorphic geometry I. Darboux transformations and spectral curves
• Mathematics
• 2009
Abstract Finding appropriate notions of discrete holomorphic maps and, more generally, conformal immersions of discrete Riemann surfaces into 3-space is an important problem of discrete differentialExpand
The Z-invariant massive Laplacian on isoradial graphs
• Mathematics, Physics
• 2015
We introduce a one-parameter family of massive Laplacian operators $$(\Delta ^{m(k)})_{k\in [0,1)}$$(Δm(k))k∈[0,1) defined on isoradial graphs, involving elliptic functions. We prove an explicitExpand
The Critical Ising Model via Kac-Ward Matrices
The Kac-Ward formula allows to compute the Ising partition function on any finite graph G from the determinant of 22g matrices, where g is the genus of a surface in which G embeds. We show that inExpand
The Dirichlet problem for orthodiagonal maps
• Mathematics
• 2019
We prove that the discrete harmonic function corresponding to smooth Dirichlet boundary conditions on orthodiagonal maps, that is, plane graphs having quadrilateral faces with orthogonal diagonals,Expand
Conformally Symmetric Triangular Lattices and Discrete ϑ-Conformal Maps
Two immersed triangulations in the plane with the same combinatorics are considered as preimage and image of a discrete immersion F . We compare the cross-ratios Q and q of corresponding pairs ofExpand

#### References

SHOWING 1-10 OF 13 REFERENCES
Discrete Riemann Surfaces and the Ising Model
Abstract: We define a new theory of discrete Riemann surfaces and present its basic results. The key idea is to consider not only a cellular decomposition of a surface, but the union with its dual.Expand
Potential theory on a rhombic lattice
Abstract Of concern are complex valued functions defined on the lattice points of the complex plane. The lattice can be the usual lattice of square blocks but of main interest is an irregular latticeExpand
Local statistics of lattice dimers
Abstract We show how to compute the probability of any given local configuration in a random tiling of the plane with dominos. That is, we explicitly compute the measures of cylinder sets for theExpand
Algebraic Graph Theory
1. Introduction to algebraic graph theory Part I. Linear Algebra in Graphic Thoery: 2. The spectrum of a graph 3. Regular graphs and line graphs 4. Cycles and cuts 5. Spanning trees and associatedExpand
An Exploration of the Permanent-Determinant Method
• G. Kuperberg
• Mathematics, Computer Science
• Electron. J. Comb.
• 1998
This work presents several new techniques and arguments related to the permanent-determinant with consequences in enumerative combinatorics, and results that follow from these techniques are presented. Expand
Trees and Matchings
• Mathematics, Computer Science
• Electron. J. Comb.
• 2000
It is shown that the weighted, directed spanning trees (often called arborescences) of any planar graph can be put into a one-to-one weight-preserving correspondence with the perfect matchings of a related planar graphs. Expand
The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice
Abstract The number of ways in which a finite quadratic lattice (with edges or with periodic boundary conditions) can be fully covered with given numbers of “horizontal” and “vertical” dimers isExpand
The Statistics of Dimers on a Lattice
The number of ways in which a finite quadratic lattice (with edges or with periodic boundary conditions) can be fully covered with given numbers of “horizontal” and “vertical” dimers is rigorouslyExpand
Discrete period matrices and related topics
We continue our investigation of Discrete Riemann Surfaces with the discussion of the discrete analogs of period matrices, Riemann's bilinear relations, exponential of constant argument, series andExpand
Multiplicities of Eigenvalues and Tree-Width of Graphs
Using multiplicities of eigenvalues of elliptic self-adjoint differential operators on graphs and transversality, we construct some new invariants of graphs which are related to tree-width.