Hypergraph polytopes

DOI10.1016/J.TOPOL.2011.05.015MaRDI QIDQ554398zbMATH OpenOpenAlexFDO

Publication date 4 August 2011

Published in Topology and its Applications (Search for Journal in Brave)

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

truncation simplex hypergraph abstract polytope associahedron permutohedron simple polytope cyclohedron

Planar graphs; geometric and topological aspects of graph theory (05C10) (n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Hypergraphs (05C65) Polyhedra and polytopes; regular figures, division of spaces (51M20) Abstract complexes in algebraic topology (55U05)

Abstract: We investigate a family of polytopes introduced by E.M. Feichtner, A. Postnikov and B. Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as constructions of hypergraphs. Limit cases in this family of polytopes are, on the one end, simplices, and, on the other end, permutohedra. In between, as notable members one finds associahedra and cyclohedra. The polytopes in this family are investigated here both as abstract polytopes and as realized in Euclidean spaces of all finite dimensions. The later realizations are inspired by J.D. Stasheff's and S. Shnider's realizations of associahedra. In these realizations, passing from simplices to permutohedra, via associahedra, cyclohedra and other interesting polytopes, involves truncating vertices, edges and other faces. The results presented here reformulate, systematize and extend previously obtained results, and in particular those concerning polytopes based on constructions of graphs, which were introduced by M. Carr and S.L. Devadoss.

Recommendations

Cites work

Cited in

(28)

This page was built for publication: Hypergraph polytopes

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