2000 character limit reached
Partition complexes and trees
Published 15 Dec 2021 in math.AT | (2112.08043v1)
Abstract: We construct a homotopy initial functor from the partition complex of a finite set $A$ to a category of trees with leaves labelled by $A$. As an application, this provides an equivalence between different bar constructions of an operad. In the differential graded case, this gives a very elementary proof of an equivalence originally due to Fresse.
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.