English

How many $n$-vertex triangulations does the $3$-sphere have?

Combinatorics 2013-11-08 v1 Geometric Topology

Abstract

It is known that the 33-sphere has at most 2O(n2logn)2^{O(n^2 \log n)} combinatorially distinct triangulations with nn vertices. Here we construct at least 2Ω(n2)2^{\Omega(n^2)} such triangulations.

Cite

@article{arxiv.1311.1641,
  title  = {How many $n$-vertex triangulations does the $3$-sphere have?},
  author = {Eran Nevo and Stedman Wilson},
  journal= {arXiv preprint arXiv:1311.1641},
  year   = {2013}
}

Comments

9 pages, 1 figure

R2 v1 2026-06-22T02:02:55.080Z