The Laplacian and Dirac operators on critical planar graphs (Q1401454): Difference between revisions

An \textit{isoradial embedding} (also called \textit{critical embedding}) of a planar graph is a regular polyhedral embedding in which all circumcircles have the same radius. Explicit expressions are presented for the logarithm of the normalized determinant of the discrete Laplacian and the discrete Dirac operator for these graphs. The definition of the Dirac operator is inspired by the \textit{dimer model} from statistical mechanics where the Dirac operator is called \textit{Kasteleyn matrix} and where the partition function is the determinant of this matrix. Also a general construction of discrete holomorphic functions and discrete harmonic functions is discussed.