Pith. Sign in

RECORD

Genus dependence of the number of (non-)orientable surface triangulations

Computational Physics · Submitted 17 Mar 2016

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim 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.

how it is stated · speculative 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1603.05618 (version 1)
Pith IDPZVQ6CCB, Pith's permanent record of this paper and its review
CitationBenedikt Kr\"uger, Klaus Mecke. "Genus dependence of the number of (non-)orientable surface triangulations." arXiv:1603.05618 (2016). https://pith.science/paper/PZVQ6CCB
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,595 input tokens.

What the abstract itself states, as probabilities: claims first 0.22 · states limitation 0.65 · human participants 0.01 · controlled comparison 0.03 · randomized assignment 0.01 · states quantitative result 0.98 · compares with prior results 0.70 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

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 $N(m,h)$ of triangulations for several order of magnitudes in system size $m$ and genus $h$. 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.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Topological triangulations of orientable and non-orientable surfaces with arbitrary genus have important applications in quantum geometry, graph theory and statistical physics. background 1.00 0.03 0.02 asserted 1.00
s1 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. gap 1.00 0.04 0.02 asserted 1.00
s2 We apply the Wang-Landau algorithm to calculate the number $N(m,h)$ of triangulations for several order of magnitudes in system size $m$ and genus $h$. method 0.97 0.97 0.04 asserted 1.00
s3 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. result 1.00 0.96 0.44 asserted 1.00
s4 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. result 0.87 0.75 0.87 speculative 1.00

What kind of paper the classifier reports this is: simulation study 1.00 · evidence from simulation or computation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original 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 $N(m,h)$ of triangulations for several order of magnitudes in system size $m$ and genus $h$. 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.

Human review
How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 2 sentences without a confident label

Cites as background 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.