Geodesic Distance in Planar Graphs: An Integrable Approach

Simple item page
dc.creatorDi Francesco, P.
dc.date2005-06-27
dc.date.accessioned2026-07-07T06:42:31Z
dc.date.available2026-07-07T06:42:31Z
dc.descriptionWe 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.
dc.description41 pages, 18 figures, uses epsf and harvmac
dc.identifierhttps://arxiv.org/abs/math/0506543
dc.identifierhttp://arxiv.org/abs/math/0506543
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/102070
dc.subjectCombinatorics
dc.subjectStatistical Mechanics
dc.subjectMathematical Physics
dc.titleGeodesic Distance in Planar Graphs: An Integrable Approach
dc.typetext

Files

Collections

arXiv