2000 character limit reached
$N_\infty$-operads and associahedra
Published 9 May 2019 in math.AT and math.CO | (1905.03797v3)
Abstract: We provide a new combinatorial approach to studying the collection of N-infinity-operads in G-equivariant homotopy theory for G a finite cyclic group. In particular, we show that for G the cyclic group of order pn the natural order on the collection of N-infinity-operads stands in bijection with the poset structure of the (n+1)-associahedron. We further provide a lower bound for the number of possible N-infinity-operads for any finite cyclic group G.
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.