An algorithmic approach to perverse derived equivalences: Brou\'e's Conjecture for +8(2)

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 C × C for a prime ; the first describes a stable equivalence between B0(G) and B0(NG(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 +8(2).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…