The distance-dependent two-point function of triangulations: a new derivation from old results

From MaRDI portal



Abstract: We present a new derivation of the distance-dependent two-point function of random planar triangulations. As it is well-known, this function is intimately related to the generating functions of so-called slices, which are pieces of triangulation having boundaries made of shortest paths of prescribed length. We show that the slice generating functions are fully determined by a direct recursive relation on their boundary length. Remarkably, the kernel of this recursion is some quantity introduced and computed by Tutte a long time ago in the context of a global enumeration of planar triangulations. We may thus rely on these old results to solve our new recursion relation explicitly in a constructive way.


The article recalls the definition of slices and their connection with the distance-dependent two-point function of random planar triangulations, and the standard integrable system obeyed by the slice generating functions. A section is dedicated to the derivation of a new recursion relation between the generating function \(T_k\) for slices with (maximum) border length \(k\) and \(T_{k-1}\). A study about simple triangulations is done in Section 4, and then it is used in the case of the explicit Tutte form for the kernel of the recursion relation to rewrite in a particularly simple and classical form. Explicit expressions for \(T_k\) and for the distance-dependent two point function are given in Section 6. Some concluding remarks are given in Section 7.











This page was built for publication: The distance-dependent two-point function of triangulations: a new derivation from old results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2360106)