The combinatorics of $N_\infty$ operads for $C_{qp^n}$ and $D_{p^n}$
Abstract: We provide a general recursive method for constructing transfer systems on finite lattices. Using this we calculate the number of homotopically distinct $N_\infty$ operads for dihedral groups $D_{pn}$, $p > 2$ prime, and cyclic groups $C_{qpn}$, $p \neq q$ prime. We then further display some of the beautiful combinatorics obtained by restricting to certain homotopically meaningful $N_\infty$ operads for these groups.
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.