Syntactic aspects of hypergraph polytopes
From MaRDI portal
Publication:2631920
Abstract: This paper introduces an inductively defined tree notation for all the faces of polytopes arising from a simplex by truncations. This notation allows us to view inclusion of faces as the process of contracting tree edges. Our notation instantiates to the well-known notations for the faces of associahedra and permutohedra. Various authors have independently introduced combinatorial tools for describing such polytopes. We build on the particular approach developed by Dosen and Petric, who used the formalism of hypergraphs to describe the interval of polytopes from the simplex to the permutohedron. This interval was further stretched by Petric to allow truncations of faces that are themselves obtained by truncations, and iteratively so. Our notation applies to all these polytopes. We illustrate this by showing that it instantiates to a notation for the faces of the permutohedron-based associahedra, that consists of parenthesised words with holes. Dosen and Petric have exhibited some families of hypergraph polytopes (associahedra, permutohedra, and hemiassociahedra) describing the coherences, and the coherences between coherences etc., arising by weakening sequential and parallel associativity of operadic composition. We complement their work with a criterion allowing us to recover the information whether edges of these "operadic polytopes" come from sequential, or from parallel associativity. We also give alternative proofs for some of the original results of Dosen and Petric.
Recommendations
- Hypergraph polytopes
- Hypergraphic polytopes: combinatorial properties and antipode
- Convex polytopes from nested posets
- Action of the symmetric groups on the homology of the hypertree posets
- The diagonal of the operahedra
- Hypergraphic polytopes: combinatorial properties and antipode
- Marked tubes and the graph multiplihedron
- Opérades différentielles graduées sur les simplexes et les permutoèdres
- Hypertrees, rooted trees and pointed partitions
- Shellability of a poset of polygonal subdivisions
Cites work
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- scientific article; zbMATH DE number 970060 (Why is no real title available?)
- scientific article; zbMATH DE number 970062 (Why is no real title available?)
- A realization of graph associahedra
- A simple permutoassociahedron
- Algebraic operads
- Categorified cyclic operads
- Coxeter complexes and graph-associahedra
- Faces of generalized permutohedra
- Higher Homotopy-Commutativity
- Homotopy Associativity of H-Spaces. I
- Hypergraph polytopes
- Incidence combinatorics of resolutions
- Iterated loop spaces
- Lectures on Polytopes
- Matroid polytopes, nested sets and Bergman fans
- Nested complexes and their polyhedral realizations
- On stretching the interval simplex-permutohedron
- Permutads
- Permutohedra, Associahedra, and Beyond
- The permutoassociahedron, Mac Lane's coherence theorem and asymptotic zones for the KZ equation
- Weak Cat-operads
Cited in
(8)- Minimal models for graph-related (hyper)operads
- Categorified cyclic operads
- A combinatorial model for the moduli of bordered Riemann surfaces and a compactification
- The diagonal of the associahedra
- Coherence via focusing for symmetric skew monoidal categories
- Hypergraph polytopes
- The diagonal of the operahedra
- Geometrical realisations of the simple permutoassociahedron by Minkowski sums
This page was built for publication: Syntactic aspects of hypergraph polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631920)
