The enumeration of planar graphs via Wick's theorem

Details The enumeration of planar graphs via Wick's theorem The enumeration of planar graphs via Wick's theorem

2006-05-09

arxiv.org/abs/math/0605218v3

Mathematics

Combinatorics

23 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The enumeration of planar graphs via Wick's theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The enumeration of planar graphs via Wick's theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The enumeration of planar graphs via Wick's theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-675771