The enumeration of planar graphs via Wick's theorem

DOI10.1016/J.AIM.2009.03.001zbMATH Open1200.05107arXivmath/0605218OpenAlexW2001253902MaRDI QIDQ1023045FDOQ1023045

Mihyun Kang, Martin Loebl

Publication date: 10 June 2009

Published in: Advances in Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/0605218

zbMATH Keywords

flowsFeynman diagramplanar mapscycle double coverfat graphsGaussian matrix integral

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
• Planar diagrams
• Asymptotic enumeration and limit laws of planar graphs
• Quantum field theory techniques in graphical enumeration
• Intersection theory on the moduli space of curves and the matrix Airy function
• Zeta functions of finite graphs and coverings
• Graphs on surfaces
• A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs
• Perturbative series and the moduli space of Riemann surfaces
• Graphs on surfaces and their applications. Appendix by Don B. Zagier
• The Euler characteristic of the moduli space of curves
• Second order asymptotics for matrix models
• Combinatorial Aspects of the Ising Model for Ferromagnetism. I. A Conjecture of Feynman on Paths and Graphs
• Matrix integrals and map enumeration: an accessible introduction
• Large random matrices: Lectures on macroscopic asymptotics. École d'Été des Probabilités de Saint-Flour XXXVI -- 2006
• Census of planar maps: From the one-matrix model solution to a combinatorial proof
• ASYMPTOTIC ANALYSIS OF A HERMITIAN MATRIX INTEGRAL
• First order asymptotics of matrix integrals; a rigorous approach towards the understanding of matrix models
• Topological characteristics of random triangulated surfaces
• Matrix model combinatorics: applications to folding and coloring.
• Random matrices, graphical enumeration and the continuum limit of Toda lattices
• Zeta functions of finite graphs and coverings. II
• Combinatorics of hard particles on planar graphs
• Duality of orthogonal and symplectic matrix integrals and quaternionic Feynman graphs
• (p,q)-odd digraphs

Cited In (3)

• Random graphs from a weighted minor-closed class
• The planar Cayley graphs are effectively enumerable. I: Consistently planar graphs
• On the enumeration of a class of plane multigraphs

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)