Abstract
Topological triangulations of orientable and nonorientable surfaces with arbitrary genus have important applications in quantum geometry, graph theory and statistical physics. However, until now, only the asymptotics for 2-spheres have been known analytically, and exact counts of triangulations are only available for both small genera and triangulations. We apply the Wang-Landau algorithm to calculate the number of triangulations for several orders of magnitude in system size and type (equals genus in orientable triangulations). 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-order and the next-to-next-to-leading-order terms. We conjecture for the number of surface triangulations the asymptotic behavior which might guide a mathematician’s proof for the exact asymptotics.
1 More- Received 27 July 2015
DOI:https://doi.org/10.1103/PhysRevD.93.085018
© 2016 American Physical Society