Diagonal $p$-permutation functors, semisimplicity, and functorial equivalence of blocks
Serge Bouc, Deniz Y{\i}lmaz

TL;DR
This paper studies diagonal p-permutation functors over fields of characteristic zero, proving their semisimplicity, classifying simple objects, and introducing a new notion of functorial equivalence of blocks with finiteness results.
Contribution
It establishes the semisimplicity of the category of diagonal p-permutation functors and introduces functorial equivalence of blocks, providing a new framework for block classification.
Findings
The category of diagonal p-permutation functors over an algebraically closed field of characteristic zero is semisimple.
Simple objects of this category are parametrized and their evaluations described.
Finiteness of block classes up to functorial equivalence for a fixed defect group.
Abstract
Let be an algebraically closed field of characteristic , let be a commutative ring, and let be an algebraically closed field of characteristic 0. We consider the -linear category of diagonal -permutation functors over . We first show that the category is semisimple, and we give a parametrization of its simple objects, together with a description of their evaluations. Next, to any pair of a finite group and a block idempotent of , we associate a diagonal -permutation functor in . We find the decomposition of the functor as a direct sum of simple functors in . This leads to a characterization of nilpotent blocks in terms of their associated functors in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Algebraic structures and combinatorial models · Advanced Topics in Algebra
