COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES
From MaRDI portal
Publication:6134981
DOI10.1112/mtk.12051zbMath1525.52006arXiv1910.05241OpenAlexW3047821054MaRDI QIDQ6134981
Jean-Philippe Labbé, Rainer Sinn, Joseph Doolittle, Jonathan Spreer, Carsten E. M. C. Lange, Günter M. Ziegler
Publication date: 23 August 2023
Published in: Mathematika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.05241
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorics of partially ordered sets (06A07) General theory of nonlinear incidence geometry (51B05)
Cites Work
- 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
- Universality theorems for inscribed polytopes and Delaunay triangulations
- Triangulations. Structures for algorithms and applications
- Voronoi diagrams from convex hulls
- Graph-theoretical conditions for inscribability and Delaunay realizability
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- Some problems on polyhedra
- A characterization of ideal polyhedra in hyperbolic 3-space
- Scribability problems for polytopes
- Discriminants, resultants, and multidimensional determinants
- Six Topics on Inscribable Polytopes
- Inscribable stacked polytopes
- Perspectives on Projective Geometry
- A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
- Lectures on Polytopes
- An enumeration of simplicial 4-polytopes with 8 vertices
- Geometry. I, II. Transl. from the French by M. Cole and S. Levy
- Riemannian geometry
