We concluded with a few open questions on the optimal constants.
Statement
We concluded with a few open questions on the optimal constants. In particular, we conjecture that the distance between two typical vertices of Tn,g is close to D\theta log n, whereas the diameter (i.e. the distance between the two furthest points) is close to D\theta′ log n with D\theta′ = 3D\theta . 2. Local limits in high genus The Euler formula shows that the average vertex degree in Tn,g is 6n 6 \approx . n + 2 − 2g 1 − 2g/n In particular, the average degree in the UIPT is equal to 6, so it may be seen as a uniform randomized version of the 6-regular triangular lattice. On the other hand, if ng converges to \theta > 0, the average degree becomes larger than 6 like in the 7- regular hyperbolic triangulation, so it seems natural to observe random hyperbolic triangulations in the limit. Indeed, we proved [2] that if gnn \to \theta \in 0, 21 , then Tn,gn converges locally to a random infinite triangulation of the plane T\theta whose distribution only depends on \theta. For \theta = 0 we recover the UIPT. For \theta > 0, we obtained a one-parameter family of models that were introduced in [5] and shown to exhibit hyperbolic behaviour (exponential volume growth, positive speed of the random walk...). A nice byproduct of this local convergence result is the asymptotic enumeration of triangulation of genus g and size n in any regime, up to a multiplicative error eo(n) . This contrasts sharply with the planar case, where enumerative estimates are the main tool used to prove local convergence results.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.