arXiv · 1508.02531
Realizability and inscribability for simplicial polytopes via nonlinear optimization
Abstract
We show that nonlinear optimization techniques can successfully be applied to realize and to inscribe matroid polytopes and simplicial spheres. Thus we obtain a complete classification of neighborly polytopes of dimension $4$, $6$ and $7$ with $11$ vertices, of neighborly $5$-polytopes with $10$ vertices, as well as a complete classification of simplicial $3$-spheres with $10$ vertices into polytopal and non-polytopal spheres. Surprisingly many of the realizable polytopes are also inscribable.
Explore related subjects
Keep this discovery
Moritz Firsching. 2015-10-26. Realizability and inscribability for simplicial polytopes via nonlinear optimization. https://doi.org/10.1007/s10107-017-1120-0
Cite the original work for its findings. Save a collection to share your selection of sources.