arXiv:2201.04847 [math.CO]AbstractReferencesReviewsResources
Equivalence Between Four Models of Associahedra
Published 2022-01-13, updated 2022-02-01Version 2
We present a combinatorial isomorphism between Stasheff associahedra and an inductive cone construction of those complexes given by Loday. We give an alternate description of certain polytopes, known as multiplihedra, which arise in the study of $A_\infty$ maps. We also prove a combinatorial isomorphism between Stasheff associahedra, collapsed multiplihedra and graph cubeahedra for path graphs.
Comments: 21 pages, 22 figures, some references and figures are added with minor changes, comments are welcome
Related articles: Most relevant | Search more
arXiv:1011.3381 [math.CO] (Published 2010-11-15)
Equivalence between Extendibility and Factor-Criticality
arXiv:1601.02928 [math.CO] (Published 2016-01-12)
An equivalence of multistatistics on permutations
arXiv:2103.07271 [math.CO] (Published 2021-03-11)
ZZ Polynomials of Regular $m$-tier Benzenoid Strips as Extended Strict Order Polynomials of Associated Posets -- Part 1. Proof of Equivalence