Dendroidal set

In mathematics, a dendroidal set is a generalization of simplicial sets introduced by Moerdijk & Weiss (2007). They have the same relation to (colored symmetric) operads, also called symmetric multicategories, that simplicial sets have to categories.

Definition

A dendroidal set is a contravariant functor from Ω to sets, where Ω is the tree category consisting of finite rooted trees considered as operads, whose morphisms are operad morphisms. The trees are allowed to have some edges with a vertex on only one side; these are called outer edges, and the root is one of the outer edges.

gollark: Well, don't blame me if someone does find the channel in use and break the banking system.

gollark: It makes it harder to intercept, but if anyone finds the channel, still plaintext.

gollark: What, using modem directly instead? Because that's not much of a fix.

gollark: But what actual change are you making?

gollark: What are you tweaking, exactly...? Because I feel like you can't make a good solution just with find and replace.

References

Moerdijk, Ieke; Weiss, Ittay (2007), "Dendroidal sets", Algebraic & Geometric Topology, 7: 1441–1470, arXiv:math/0701293, doi:10.2140/agt.2007.7.1441, ISSN 1472-2747, MR 2366165
Dendroidal set in nLab

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.