2000 character limit reached
$\infty$-operads via symmetric sequences
Published 31 Aug 2017 in math.AT and math.CT | (1708.09632v3)
Abstract: We construct a generalization of the Day convolution tensor product of presheaves that works for certain double $\infty$-categories. Using this construction, we obtain an $\infty$-categorical version of the well-known description of (one-object) operads as associative algebras in symmetric sequences; more generally, we show that (enriched) $\infty$-operads with varying spaces of objects can be described as associative algebras in a double $\infty$-category of symmetric collections.
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.