Geodesic Distance in Planar Graphs: An Integrable Approach

Details Geodesic Distance in Planar Graphs: An Integrable Approach Geodesic Distance in Planar Graphs: An Integrable Approach

2005-06-27

arxiv.org/abs/math/0506543v1

Mathematics

Combinatorics

41 pages, 18 figures, uses epsf and harvmac

Scientific paper

We discuss the enumeration of planar graphs using bijections with suitably decorated trees, which allow for keeping track of the geodesic distances between faces of the graph. The corresponding generating functions obey non-linear recursion relations on the geodesic distance. These are solved by use of stationary multi-soliton tau-functions of suitable reductions of the KP hierarchy. We obtain a unified formulation of the (multi-) critical continuum limit describing large graphs with marked points at large geodesic distances, and obtain integrable differential equations for the corresponding scaling functions. This provides a continuum formulation of two-dimensional quantum gravity, in terms of the geodesic distance.

Affiliated with

Also associated with

No associations

Rating

Geodesic Distance in Planar Graphs: An Integrable Approach 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 Geodesic Distance in Planar Graphs: An Integrable Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geodesic Distance in Planar Graphs: An Integrable Approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-646432