Scribability problems for polytopes

DOI10.1016/J.EJC.2017.02.006MaRDI QIDQ2359975zbMATH OpenOpenAlexFDO

Authors Hao Chen, Arnau Padrol

Publication date 23 June 2017

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1508.03537

zbMATH Keywords

\(d\)-polytopesscribability problems

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11)

Abstract: In this paper we study various scribability problems for polytopes. We begin with the classical $k$-scribability problem proposed by Steiner and generalized by Schulte, which asks about the existence of $d$-polytopes that cannot be realized with all $k$-faces tangent to a sphere. We answer this problem for stacked and cyclic polytopes for all values of $d$ and $k$. We then continue with the weak scribability problem proposed by Gr"unbaum and Shephard, for which we complete the work of Schulte by presenting non weakly circumscribable $3$-polytopes. Finally, we propose new $(i,j)$-scribability problems, in a strong and a weak version, which generalize the classical ones. They ask about the existence of $d$-polytopes that can not be realized with all their $i$-faces "avoiding" the sphere and all their $j$-faces "cutting" the sphere. We provide such examples for all the cases where $j-iled-3$.

Recommendations

• scientific article; zbMATH DE number 4026241
• Six topics on inscribable polytopes
• scientific article; zbMATH DE number 665700
• A note on the simplex-cosimplex problem
• Inscribable stacked polytopes

Cites work

• A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
• A characterization of ideal polyhedra in hyperbolic 3-space
• A proof of the lower bound conjecture for convex polytopes
• Antiprismlessness, or: reducing combinatorial equivalence to projective equivalence in realizability problems for polytopes
• Apollonian ball packings and stacked polytopes
• Buildings
• Combinatorial optimization in geometry
• Comparing corresponding dihedral angles on classical geometric simplices
• Convex Polytopes
• Convex polytopes: extremal constructions and f-vector shapes
• Cyclic polytopes and d-order curves
• Cyclic polytopes and oriented matroids
• Discrete differential geometry. Integrable structure
• DISCRETE LINEAR GROUPS GENERATED BY REFLECTIONS
• Distance Sums on a Sphere and Angle Sums in a Simplex
• Euclidean structures on simplicial surfaces and hyperbolic volume
• Foundations of Hyperbolic Manifolds
• Geometry II: spaces of constant curvature. Transl. from the Russian by V. Minachin
• How to cage an egg
• scientific article; zbMATH DE number 4026241 (Why is no real title available?)
• scientific article; zbMATH DE number 17662 (Why is no real title available?)
• scientific article; zbMATH DE number 2068109 (Why is no real title available?)
• scientific article; zbMATH DE number 3266280 (Why is no real title available?)
• scientific article; zbMATH DE number 3027510 (Why is no real title available?)
• Hyperideal circle patterns
• Hyperideal polyhedra in hyperbolic 3-space
• Inscribable stacked polytopes
• Lectures on Polytopes
• Lorentzian Coxeter systems and Boyd-Maxwell ball packings
• Many projectively unique polytopes
• Neighborly inscribed polytopes and Delaunay triangulations
• ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES
• ON CONVEX POLYHEDRA OF FINITE VOLUME IN LOBAČEVSKIĬ SPACE
• On geometry of convex ideal polyhedra in hyperbolic 3-space
• Realizability and inscribability for simplicial polytopes via nonlinear optimization
• Realization spaces of polytopes
• Separators for sphere-packings and nearest neighbor graphs
• Some problems on polyhedra
• The E_t-construction for lattices, spheres and polytopes
• The maximum numbers of faces of a convex polytope
• The minimum number of vertices of a simple polytope

Cited in

(7)

• scientific article; zbMATH DE number 4026241 (Why is no real title available?)
• Continuous maps from spheres converging to boundaries of convex hulls
• Weakly inscribed polyhedra
• COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES
• Links in orthoplicial Apollonian packings
• Inscribable order types
• A polytopal generalization of Apollonian packings and Descartes' theorem

This page was built for publication: Scribability problems for polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359975)