Planar maps and continued fractions

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.

47 pages, 17 figures, final version (very minor changes since v2)

References in corpus (1)

• Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop

Cited by in corpus (11)

• More on the O(n) model on random maps via nested loops: loops with bending energy
• Trees and spatial topology change in CDT
• On irreducible maps and slices
• Spanning forests in regular planar maps
• Nesting statistics in the O(n) loop model on random planar maps
• Bijective enumeration of planar bipartite maps with three tight boundaries, or how to slice pairs of pants
• The skeleton of the UIPT, seen from infinity
• The three-point function of general planar maps
• Critical Behaviour of Spanning Forests on Random Planar Graphs
• Refined universal laws for hull volumes and perimeters in large planar maps
• Maps of unfixed genus and blossoming trees