Syntactic aspects of hypergraph polytopes
Samo za registrovane korisnike
2019
Članak u časopisu (Objavljena verzija)
,
Springer
Metapodaci
Prikaz svih podataka o dokumentuApstrakt
This paper introduces an inductive tree notation for all the faces of polytopes arising
from a simplex by truncations, which allows viewing face inclusion as the process of
contracting tree edges.These polytopes, knownas hypergraph polytopes or nestohedra,
fit in the interval from simplices to permutohedra (in any finite dimension). This
intervalwas further stretched by Petri´c to allowtruncations of faces that are themselves
obtained by truncations. Our notation applies to all these polytopes. As an illustration,
we detail the case of Petri´c’s permutohedron-based associahedra. As an application,
we present a criterion for determining whether edges of polytopes associated with the
coherences of categorified operads correspond to sequential, or to parallel associativity.
Ključne reči:
Polytopes / Operads / Categorification / CoherenceIzvor:
The Journal of Homotopy and Related Structures (JHRS), 2019, 14, 235-279Izdavač:
- Springer
Institucija/grupa
Arhitektonski fakultetTY - JOUR AU - Curien, Pierre-Louis AU - Obradović, Jovana AU - Ivanović, Jelena PY - 2019 UR - https://raf.arh.bg.ac.rs/handle/123456789/1168 AB - This paper introduces an inductive tree notation for all the faces of polytopes arising from a simplex by truncations, which allows viewing face inclusion as the process of contracting tree edges.These polytopes, knownas hypergraph polytopes or nestohedra, fit in the interval from simplices to permutohedra (in any finite dimension). This intervalwas further stretched by Petri´c to allowtruncations of faces that are themselves obtained by truncations. Our notation applies to all these polytopes. As an illustration, we detail the case of Petri´c’s permutohedron-based associahedra. As an application, we present a criterion for determining whether edges of polytopes associated with the coherences of categorified operads correspond to sequential, or to parallel associativity. PB - Springer T2 - The Journal of Homotopy and Related Structures (JHRS) T1 - Syntactic aspects of hypergraph polytopes IS - 14 SP - 235 EP - 279 DO - 10.1007/s40062-018-0211-9 ER -
@article{ author = "Curien, Pierre-Louis and Obradović, Jovana and Ivanović, Jelena", year = "2019", abstract = "This paper introduces an inductive tree notation for all the faces of polytopes arising from a simplex by truncations, which allows viewing face inclusion as the process of contracting tree edges.These polytopes, knownas hypergraph polytopes or nestohedra, fit in the interval from simplices to permutohedra (in any finite dimension). This intervalwas further stretched by Petri´c to allowtruncations of faces that are themselves obtained by truncations. Our notation applies to all these polytopes. As an illustration, we detail the case of Petri´c’s permutohedron-based associahedra. As an application, we present a criterion for determining whether edges of polytopes associated with the coherences of categorified operads correspond to sequential, or to parallel associativity.", publisher = "Springer", journal = "The Journal of Homotopy and Related Structures (JHRS)", title = "Syntactic aspects of hypergraph polytopes", number = "14", pages = "235-279", doi = "10.1007/s40062-018-0211-9" }
Curien, P., Obradović, J.,& Ivanović, J.. (2019). Syntactic aspects of hypergraph polytopes. in The Journal of Homotopy and Related Structures (JHRS) Springer.(14), 235-279. https://doi.org/10.1007/s40062-018-0211-9
Curien P, Obradović J, Ivanović J. Syntactic aspects of hypergraph polytopes. in The Journal of Homotopy and Related Structures (JHRS). 2019;(14):235-279. doi:10.1007/s40062-018-0211-9 .
Curien, Pierre-Louis, Obradović, Jovana, Ivanović, Jelena, "Syntactic aspects of hypergraph polytopes" in The Journal of Homotopy and Related Structures (JHRS), no. 14 (2019):235-279, https://doi.org/10.1007/s40062-018-0211-9 . .