Realizability and inscribability for simplicial polytopes via nonlinear optimization
From MaRDI portal
Publication:1683692
DOI10.1007/s10107-017-1120-0zbMath1379.52017arXiv1508.02531OpenAlexW2218862664MaRDI QIDQ1683692
Publication date: 1 December 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.02531
(n)-dimensional polytopes (52B11) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Nonlinear programming (90C30) Oriented matroids in discrete geometry (52C40)
Related Items
Scribability problems for polytopes, Small $f$-vectors of 3-spheres and of 4-polytopes, Average Betti numbers of induced subcomplexes in triangulations of manifolds, COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES, Universal oriented matroids for subword complexes of Coxeter groups, Combining realization space models of polytopes, A FLAG VECTOR OF A 3‐SPHERE THAT IS NOT THE FLAG VECTOR OF A 4‐POLYTOPE, Neighborly inscribed polytopes and Delaunay triangulations, A proof of the strict monotone 5-step conjecture, The complete enumeration of 4-polytopes and 3-spheres with nine vertices, Small covers and quasitoric manifolds over neighborly polytopes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complete enumeration of the 4-polytopes and 3-spheres with eight vertices
- Many neighborly polytopes and oriented matroids
- Neighborly 6-polytopes with 10 vertices
- Neighborly polytopes and oriented matroids
- On the finding of final polynomials
- SCIP: solving constraint integer programs
- On combinatorial and affine automorphisms of polytopes
- Counting \(d\)-polytopes with \(d+3\) vertices
- Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
- Universality theorems for inscribed polytopes and Delaunay triangulations
- Rational points on the unit sphere
- Symmetric matroid polytopes and their generation
- Neighborly polytopes
- Many triangulated spheres
- Voronoi diagrams from convex hulls
- The classification of simplicial 3-spheres with nine vertices into polytopes and nonpolytopes
- Computational synthetic geometry
- Sphären mit wenigen Ecken
- On the enumeration of convex polyhedra
- Graph-theoretical conditions for inscribability and Delaunay realizability
- A structure theorem for pseudomanifolds
- Neighborly inscribed polytopes and Delaunay triangulations
- Counting polytopes via the Radon complex
- Equifacetted 3-spheres as topes of nonpolytopal matroid polytopes
- Two interesting oriented matroids
- Complete enumeration of small realizable oriented matroids
- Neighborly 4-polytopes with 9 vertices
- Simplicial neighbourly 5-polytopes with nine vertices
- Combinatorial \(3\)-manifolds with \(10\) vertices
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Spheres with few vertices
- Inscribable stacked polytopes
- Enumerating Neighborly Polytopes and Oriented Matroids
- Boundary Complexes of Convex Polytopes cannot Be Characterized Locally
- The Number of Rooted Convex Polyhedra
- The Asymptotic Number of Convex Polyhedra
- A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
- Neighborly 4-Polytopes and Neighborly Combinatorial 3-Manifolds with Ten Vertices
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Oriented Matroids
- The number of simplicial neighbourly d ‐polytopes with d +3 vertices
- The number of neighbourly d ‐polytopes with d +3 vertices
- Realization spaces of 4-polytopes are universal
- Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets
- Computing Maximal Copies of Polyhedra Contained in a Polyhedron
- More bounds on the diameters of convex polytopes
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Neighborliness of randomly projected simplices in high dimensions
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- An enumeration of simplicial 4-polytopes with 8 vertices
- The number of d ‐polytopes with d +3 vertices
- The maximum numbers of faces of a convex polytope
