Mathematics – Combinatorics
Scientific paper
2010-10-26
Mathematics
Combinatorics
68 pages, updated references
Scientific paper
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.
Dosen Kosta
Petric Zoran
No associations
LandOfFree
Hypergraph Polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Hypergraph Polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hypergraph Polytopes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-160044