Papers
Topics
Authors
Recent
Search
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.

Citations (20)

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.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.