Partition complexes and trees

Gijs Heuts; Ieke Moerdijk

doi:10.1090/proc/16300

Partition complexes and trees

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

We construct a functor from the partition complex of a finite set A to a category of trees with leaves labelled by A and prove that it is homotopy initial. This construction and our proof are elementary and require very few preliminaries, but imply an equivalence between different bar constructions of an operad in great generality.

Original language	English
Pages (from-to)	2723-2732
Number of pages	10
Journal	Proceedings of the American Mathematical Society
Volume	151
Issue number	6
Early online date	14 May 2023
DOIs	https://doi.org/10.1090/proc/16300
Publication status	Published - 1 Jun 2023

Access to Document

10.1090/proc/16300

Partition complexes and treesFinal published version, 163 KBLicence: Taverne

Cite this

@article{e680e48ac80d4583a38eb7597c27488b,

title = "Partition complexes and trees",

abstract = "We construct a functor from the partition complex of a finite set A to a category of trees with leaves labelled by A and prove that it is homotopy initial. This construction and our proof are elementary and require very few preliminaries, but imply an equivalence between different bar constructions of an operad in great generality.",

author = "Gijs Heuts and Ieke Moerdijk",

note = "Publisher Copyright: {\textcopyright} 2023 American Mathematical Society.",

year = "2023",

month = jun,

day = "1",

doi = "10.1090/proc/16300",

language = "English",

volume = "151",

pages = "2723--2732",

journal = "Proceedings of the American Mathematical Society",

issn = "0002-9939",

publisher = "American Mathematical Society",

number = "6",

}

TY - JOUR

T1 - Partition complexes and trees

AU - Heuts, Gijs

AU - Moerdijk, Ieke

PY - 2023/6/1

Y1 - 2023/6/1

N2 - We construct a functor from the partition complex of a finite set A to a category of trees with leaves labelled by A and prove that it is homotopy initial. This construction and our proof are elementary and require very few preliminaries, but imply an equivalence between different bar constructions of an operad in great generality.

AB - We construct a functor from the partition complex of a finite set A to a category of trees with leaves labelled by A and prove that it is homotopy initial. This construction and our proof are elementary and require very few preliminaries, but imply an equivalence between different bar constructions of an operad in great generality.

UR - http://www.scopus.com/inward/record.url?scp=85158161697&partnerID=8YFLogxK

U2 - 10.1090/proc/16300

DO - 10.1090/proc/16300

M3 - Article

AN - SCOPUS:85158161697

SN - 0002-9939

VL - 151

SP - 2723

EP - 2732

JO - Proceedings of the American Mathematical Society

JF - Proceedings of the American Mathematical Society

IS - 6

ER -

Partition complexes and trees

Abstract

Access to Document

Fingerprint

Cite this