Using Gale transforms, the author proves that for every \(d \geq 3\) there are two \(d\)-simplices \(S_1, S_2 \subset\mathbb{R}^d\) such that \(0 \in \text{int } S_1 \cap \text{int } S_2\) and no \((d-1)\)-subspace contains more than one of the \(2d + 2\) facets of \(S_1\) and \(S_2\) in either of its closed half-spaces. This statement yields the main result of the paper: for every \(d \geq 4\), there is a \(d\)-polytope \(P \subset \mathbb{R}^d\) with two vertices \(v\), \(w\) such that no hyperplane through \(v\) and \(w\) has more than one facet of \(P\) in either of its closed half- spaces. This shows that facet-reducing cuts, containing a prespecified pair of vertices of a polytope, do not exist in general.
- Cell decomposition of polytopes by bending
- Complete subgraphs of the graphs of convex polytopes
- How big can the circuits of a bridge of a maximal circuit be?
- scientific article; zbMATH DE number 4158663 (Why is no real title available?)
- scientific article; zbMATH DE number 3804333 (Why is no real title available?)
- scientific article; zbMATH DE number 878328 (Why is no real title available?)
- scientific article; zbMATH DE number 3345859 (Why is no real title available?)
- Hyperplane cuts of an n-cube
- Hyperplane sections of polyhedra, toroidal manifolds, and discrete groups in Lobachevskij space
- On hyperplanes and polytopes
- Sections and projections of convex polytopes
- Shadow‐boundaries and cuts of convex polytopes
- Cyclic polytopes, hyperplanes, and Gray codes
- Cutting a polytope
- On polytopes cut by flats
- Cutting polytopes and flag \(f\)-vectors
- Vertex-facet assignments for polytopes
- Generating facets for the cut polytope of a graph by triangular elimination
- Polytopes with parathetic faces
- The cut cone. III: On the role of triangle facets
- On hyperplanes and polytopes
This page was built for publication: Facet-reducing cuts of a convex polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900968)
