Genus dependence of the number of (non-)orientable surface triangulations
arXiv:1603.05618 · doi:10.1103/PhysRevD.93.085018
Abstract
Topological triangulations of orientable and non-orientable surfaces with arbitrary genus have important applications in quantum geometry, graph theory and statistical physics. However, until now only the asymptotics for 2-spheres are known analytically, and exact counts of triangulations are only available for both small genus and small triangulations. We apply the Wang-Landau algorithm to calculate the number of triangulations for several order of magnitudes in system size and genus . We verify that the limit of the entropy density of triangulations is independent of genus and orientability and are able to determine the next-to-leading and the next-to-next-to-leading order terms. We conjecture for the number of surface triangulations the asymptotic behavior \begin{equation*} N(m,h) \rightarrow (170.4 \pm 15.1)^h m^{-2(h - 1)/5} \left( \frac{256}{27} \right)^{m / 2}\;, \end{equation*} what might guide a mathematicians proof for the exact asymptotics.
arXiv comment6 pages, 8 figures, to appear in Phys. Rev. D
References in corpus (14)
- An efficient, multiple range random walk algorithm to calculate the density of states
- Determining the density of states for classical statistical models: A random walk algorithm to produce a flat histogram
- Reconstructing the Universe
- Colored Tensor Models - a Review
- Group Field Theory: An overview
- Quantum Gravity and Renormalization: The Tensor Track
- On locally constructible spheres and balls
- Surface realization with the intersection edge functional
- Exploring complex networks via topological embedding on surfaces
- Remarks on the entropy of 3-manifolds
- Entropy and the Approach to the Thermodynamic Limit in Three-Dimensional Simplicial Gravity
- Many triangulated odd-spheres
- Freezing of Triangulations
- Entropy of unimodular Lattice Triangulations