2000 character limit reached
Equivalence Between Four Models of Associahedra
Published 13 Jan 2022 in math.CO and math.AT | (2201.04847v2)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.