2000 character limit reached
Higher cyclic operads (1611.02591v3)
Published 8 Nov 2016 in math.AT and math.CT
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.
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.