Syntactic aspects of hypergraph polytopes (Q2631920)

\textit{K. Došen} and \textit{Z. Petrić} [Topology Appl. 158, No. 12, 1405--1444 (2011; Zbl 1222.05193)] considered a family of polytopes that can be obtained by truncating the vertices, edges and other faces of simplices of any finite dimension. This kind of polytopes are called hypergraph polytopes or nestohedra. In particular, the permutohedra are obtained by making all the possible truncations. The faces of hypergraph polytopes are named by combinatorial objects called constructs or nested sets. In [loc. cit.], it is proved that there is an isomorphism between the poset of constructs and the poset of faces in the geometric realisation of the polytope. Originally, the constructs were defined as certain sets of connected subsets of a hypergraph. In the paper under review, the authors give them an equivalent definition as decorated trees obtained in an algorithmic manner. They also give an alternative, constructive proof for the isomorphism result of Došen and Petrić [loc. cit.]. As an application, they present a criterion to determine whether edges of polytopes associated with the coherences of categorified operads correspond to sequential or to parallel associativity.