The enumeration of planar graphs via Wick's theorem
From MaRDI portal
(Redirected from Publication:1023045)
Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Feynman diagrams (81T18) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Abstract: A seminal technique of theoretical physics called Wick's theorem interprets the Gaussian matrix integral of the products of the trace of powers of Hermitian matrices as the number of labelled maps with a given degree sequence, sorted by their Euler characteristics. This leads to the map enumeration results analogous to those obtained by combinatorial methods. In this paper we show that the enumeration of the graphs embeddable on a given 2-dimensional surface (a main research topic of contemporary enumerative combinatorics) can also be formulated as the Gaussian matrix integral of an ice-type partition function. Some of the most puzzling conjectures of discrete mathematics are related to the notion of the cycle double cover. We express the number of the graphs with a fixed directed cycle double cover as the Gaussian matrix integral of an Ihara-Selberg-type function.
Recommendations
- Matrix integrals and map enumeration: an accessible introduction
- Census of planar maps: From the one-matrix model solution to a combinatorial proof
- Constructing restricted Patterson measures for geometrically infinite Kleinian groups
- Counting surfaces. CRM Aisenstadt chair lectures
- Random matrices and enumeration of maps
Cites work
- scientific article; zbMATH DE number 3137403 (Why is no real title available?)
- scientific article; zbMATH DE number 1974573 (Why is no real title available?)
- scientific article; zbMATH DE number 1890852 (Why is no real title available?)
- (p,q)-odd digraphs
- 2D quantum gravity, matrix models and graph combinatorics
- A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs
- ASYMPTOTIC ANALYSIS OF A HERMITIAN MATRIX INTEGRAL
- Asymptotic enumeration and limit laws of planar graphs
- Census of planar maps: From the one-matrix model solution to a combinatorial proof
- Combinatorial Aspects of the Ising Model for Ferromagnetism. I. A Conjecture of Feynman on Paths and Graphs
- Combinatorics of hard particles on planar graphs
- Duality of orthogonal and symplectic matrix integrals and quaternionic Feynman graphs
- First order asymptotics of matrix integrals; a rigorous approach towards the understanding of matrix models
- Graphs on surfaces
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- Intersection theory on the moduli space of curves and the matrix Airy function
- Large random matrices: Lectures on macroscopic asymptotics. École d'Été des Probabilités de Saint-Flour XXXVI -- 2006
- Matrix integrals and map enumeration: an accessible introduction
- Matrix model combinatorics: applications to folding and coloring.
- Perturbative series and the moduli space of Riemann surfaces
- Planar diagrams
- Quantum field theory techniques in graphical enumeration
- Random matrices and enumeration of maps
- Random matrices, graphical enumeration and the continuum limit of Toda lattices
- Second order asymptotics for matrix models
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- The Euler characteristic of the moduli space of curves
- Topological characteristics of random triangulated surfaces
- Zeta functions of finite graphs and coverings
- Zeta functions of finite graphs and coverings. II
Cited in
(4)
This page was built for publication: The enumeration of planar graphs via Wick's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1023045)
