2000 character limit reached
Categories of graphs for operadic structures
Published 13 Sep 2021 in math.CT and math.AT | (2109.06231v2)
Abstract: We recall several categories of graphs which are useful for describing homotopy-coherent versions of generalized operads (e.g. cyclic operads, modular operads, properads, and so on), and give new, uniform definitions for their morphisms. This allows for straightforward comparisons, and we use this to show that certain free-forgetful adjunctions between categories of generalized operads can be realized at the level of presheaves. This includes adjunctions between operads and cyclic operads, between dioperads and augmented cyclic operads, and betweeen wheeled properads and modular operads.
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.