Enumeration of planar graphs by matrix integrals
Seminar Room 1, Newton Institute
We apply matrix integrals to combinatorially defined functions (not to the functions of the traces) and express: The number of graphs embeddable in the plane as the matrix integral of an ice-type partition function; the number of the directed cycle double covers as the matrix integral of an Ihara-Selberg-type function. The asymptotic analysis of the integrals remains a challenging open problem.
(joint work with Mihyun Kang)
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.