How many nn-vertex triangulations does the 33-sphere have?

preprint2013arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.