Abstract: A removahedron is a polytope obtained by deleting inequalities from the facet description of the classical permutahedron. Relevant examples range from the associahedra to the permutahedron itself, which raises the natural question to characterize which nestohedra can be realized as removahedra. In this note, we show that the nested complex of any connected building set closed under intersection can be realized as a removahedron. We present two different complementary proofs: one based on the building trees and the nested fan, and the other based on Minkowski sums of dilated faces of the standard simplex. In general, this closure condition is sufficient but not necessary to obtain removahedra. However, we show that it is also necessary to obtain removahedra from graphical building sets, and that it is equivalent to the corresponding graph being chordful (i.e. any cycle induces a clique).
Recommendations
Cited in
(11)- Deformation cones of graph associahedra and nestohedra
- The diagonal of the operahedra
- Removahedral congruences versus permutree congruences
- Frankl-Füredi-Kalai inequalities on the \(\gamma\)-vectors of flag nestohedra
- Type cones of permutree fans
- The permuto-associahedron revisited
- Fertilitopes
- Celebrating Loday's associahedron
- Real toric manifolds associated with chordal nestohedra
- Associahedra via spines
- The kernel of chromatic quasisymmetric functions on graphs and hypergraphic polytopes
This page was built for publication: Which nestohedra are removahedra?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4605933)
