Cutting polytopes and flag f-vectors
The \({\mathbf c}{\mathbf d}\)-index of a polytope \(P\) encodes all the entries of the flag \(f\)-vector of \(P\). However, even standard operations on polytopes, such as the join and direct product, lead to complicated expressions for the resulting \({\mathbf c}{\mathbf d}\)-indices. Here, the authors show how to find the \({\mathbf c}{\mathbf d}\)-index of the polytope obtained by cutting off a face \(F\) of \(P\), by which is meant moving a hyperplane which supports \(P\) in \(F\) a little into \(P\). On the way, they find the \({\mathbf c}{\mathbf d}\)-index of the cell complex obtained by contracting \(F\) to a point.
- Flag vectors of multiplicial polytopes
- On the cut polytope
- On polytopes cut by flats
- scientific article; zbMATH DE number 176916
- The cut polytope and the Boolean quadric polytope
- Facet-reducing cuts of a convex polytope
- scientific article; zbMATH DE number 805101
- Relationships among flag \(f\)-vector inequalities for polytopes
- scientific article; zbMATH DE number 7499154
- On the polyhedral structure of uniform cut polytopes
- Flag-homogeneous compact connected polygons. II
- On polytopes cut by flats
- Cutting sequences, regular polygons, and the Veech group
- Euler flag enumeration of Whitney stratified spaces
- The cd-index: a survey
- Facial structures of a generalized wedge of polytopes
- Convex-ear decompositions and the flag \(h\)-vector
- The Tchebyshev transforms of the first and second kind
This page was built for publication: Cutting polytopes and flag \(f\)-vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971508)
