Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a255f3b5f8012877

Jump to content

Dendroidal set

From Wikipedia, the free encyclopedia

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

[edit]

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.

References

[edit]
  • 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 at the nLab