Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Encoding Equivariant Commutativity via Operads (1707.02130v3)

Published 7 Jul 2017 in math.AT

Abstract: In this paper, we prove a conjecture of Blumberg and Hill regarding the existence of $N_\infty$-operads associated to given sequences $\mathcal{F} = (\mathcal{F}n){n \in \mathbb{N}}$ of families of subgroups of $G\times \Sigma_n$. For every such sequence, we construct a model structure on the category of $G$-operads, and we use these model structures to define $E_\infty{\mathcal{F}}$-operads, generalizing the notion of an $N_\infty$-operad, and to prove the Blumberg-Hill conjecture. We then explore questions of admissibility, rectification, and preservation under left Bousfield localization for these $E_\infty{\mathcal{F}}$-operads, obtaining some new results as well for $N_\infty$-operads.

Summary

We haven't generated a summary for this paper yet.