2000 character limit reached
An algorithmic approach to perverse derived equivalences: Broué's Conjecture for $Ω^{+}_8(2)$
Published 2 Oct 2018 in math.RT and math.GR | (1810.01467v3)
Abstract: Following Craven and Rouquier's computational method to tackle Brou\'e's abelian defect group conjecture, we present two algorithms implementing that procedure in the case of principal blocks of defect $D \cong C_{\ell} \times C_{\ell}$ for a prime $\ell$; the first describes a stable equivalence between $B_0(G)$ and $B_0(N_G(D))$, and the second tries to lift a such stable equivalence to a perverse derived equivalence. As an application, we show that Brou\'e's conjecture holds for the principal $5$-block of the simple group $\Omega{+}_8(2)$.
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.