On the entropy bound of three dimensional simplicial gravity

Abstract

It is proven that the partition function of 3-dimensional simplicial gravity has an exponential upper bound with the following assumption: any three dimensional sphere $S^3$ is constructed by repeated identification of neighboring links and neighboring triangles in the boundary of a simplicial 3-ball. This assumption is weaker than the one proposed by other authors.

6 pages, two figures (in uudecode compressed tar)

References in corpus (2)

• Entropy of random coverings and 4D quantum gravity
• On Entropy of 3-Dimensional Simplicial Complexes

Cited by in corpus (3)

• On the number of coloured triangulations of $d$-manifolds
• 2-LC triangulated manifolds are exponentially many
• Mogami manifolds, nuclei, and 3D simplicial gravity