arXiv subjects

Stedman Wilson

Publications and source records attributed to Stedman Wilson.

3 recordsLinked to original sources

arXiv2014

Many triangulated odd-spheres

It is known that the $(2k-1)$-sphere has at most $2^{O(n^k \log n)}$ combinatorially distinct triangulations with $n$ vertices, for every $k\ge 2$. Here we construct at least $2^{\Omega(n^k)}$ such triangulations, improving on the previous constructions which gave $2^{\Omega(n^{k-1})}$ in the general case (Kalai) and $2^{\Omega(n^{5/4})}$ for $k=2$ (Pfeifle-Ziegler). We also construct $2^{\Omega\left(n^{k-1+\frac{1}{k}}\right)}$ geodesic (a.k.a. star-convex) $n$-vertex triangualtions of the $(2k-1)$-sphere. As a step for this (in the case $k=2$) we construct $n$-vertex $4$-polytopes containing $\Omega(n^{3/2})$ facets that are not simplices, or with $\Omega(n^{3/2})$ edges of degree three.

math.CO↗

arXiv2013

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

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^{Ω(n^2)}$ such triangulations.

math.CO↗

arXiv2013

A Quantitative Steinitz Theorem for Plane Triangulations

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 realizing a given triangulation, subexponential in a number of special cases. Formally, we prove that every plane triangulation $G$ with $n$ vertices can be embedded in $\mathbb{R}^2$ in such a way that it is the vertical projection of a convex polyhedral surface. We show that the vertices of this surface may be placed in a $4n^3 \times 8n^5 \times ζ(n)$ integer grid, where $ζ(n) \leq (500 n^8)^{τ(G)}$ and $τ(G)$ denotes the shedding diameter of $G$, a quantity defined in the paper.

math.CO↗