Stedman Wilson

13 citations · 14 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2014★ 13 cited

Many triangulated odd-spheres

Eran Nevo, Francisco Santos, Stedman Wilson

It is known that the $(2 k - 1)$ -sphere has at most $2^{O (n^{k} l o g n)}$ combinatorially distinct triangulations with $n$ vertices, for every $k \geq 2$ . Here we construct at least $2^{Ω…

math.CO2013

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

Eran Nevo, Stedman Wilson

It is known that the $3$ -sphere has at most $2^{O (n^{2} l o g n)}$ combinatorially distinct triangulations with $n$ vertices. Here we construct at least $2^{Ω (n^{2})}$ such triangulatio…

math.CO2013★ 1 cited

A Quantitative Steinitz Theorem for Plane Triangulations

Igor Pak, Stedman Wilson

We give a new proof of Steinitz's classical theorem in the case of plane triangulations, which allows us to obtain a new general bound on the grid size of the simplicial polytope r…

Many triangulated odd-spheres

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

A Quantitative Steinitz Theorem for Plane Triangulations

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