Planar maps and continued fractions
Preprint
Abstract
We present an unexpected connection between two map enumeration problems. The first one consists in counting planar maps with a boundary of prescribed length. The second one consists in counting planar maps with two points at a prescribed distance. We show that, in the general class of maps with controlled face degrees, the solution for both problems is actually encoded into the same quantity, respectively via its power series expansion and its continued fraction expansion. We then use known techniques for tackling the first problem in order to solve the second. This novel viewpoint provides a constructive approach for computing the so-called distance-dependent two-point function of general planar maps. We prove and extend some previously predicted exact formulas, which we identify in terms of particular Schur functions.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Polynomial equations with one catalytic variable, algebraic series and map enumerationJournal of Combinatorial Theory, Series B, 2006
- Integrability of graph combinatorics via random walks and heaps of dimersJournal of Statistical Mechanics: Theory and Experiment, 2005
- Random planar lattices and integrated superBrownian excursionProbability Theory and Related Fields, 2003
- Geodesic distance in planar graphsNuclear Physics B, 2003
- Census of planar maps: from the one-matrix model solution to a combinatorial proofNuclear Physics B, 2002
- Lattice Path Proofs for Determinantal Formulas for Symplectic and Orthogonal CharactersJournal of Combinatorial Theory, Series A, 1997
- Scaling in quantum gravityNuclear Physics B, 1995
- 2D gravity and random matricesPhysics Reports, 1995
- Planar diagramsCommunications in Mathematical Physics, 1978
- On the existence of square roots in certain rings of power seriesMathematische Annalen, 1965