Papers
Topics
Authors
Recent
Search
2000 character limit reached

Higher cyclic operads

Published 8 Nov 2016 in math.AT and math.CT | (1611.02591v3)

Abstract: We introduce a convenient definition for weak cyclic operads, which is based on unrooted trees and Segal conditions. More specifically, we introduce a category $\Xi$ of trees, which carries a tight relationship to the Moerdijk-Weiss category of rooted trees $\Omega$. We prove a nerve theorem exhibiting colored cyclic operads as presheaves on $\Xi$ which satisfy a Segal condition. Finally, we produce a Quillen model category whose fibrant objects satisfy a weak Segal condition, and we consider these objects as an up-to-homotopy generalization of the concept of cyclic operad.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.