How many n-vertex triangulations does the 3-sphere have?
classification
🧮 math.CO
math.GT
keywords
triangulationsspherecombinatoriallyconstructdistincthereknownleast
read the original abstract
It is known that the $3$-sphere has at most $2^{O(n^2 \log n)}$ combinatorially distinct triangulations with $n$ vertices. Here we construct at least $2^{\Omega(n^2)}$ such triangulations.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.