Perverse Equivalences and Dg-stable Combinatorics
Jeremy Brightbill

TL;DR
This paper extends the theory of perverse equivalences to Calabi-Yau categories of negative dimension, linking it to mutation theory of simple-minded systems and providing a combinatorial model for Brauer tree algebras.
Contribution
It develops an analogue of perverse equivalences for negative Calabi-Yau categories and connects it to mutation theory, with explicit models for Brauer tree algebras.
Findings
Differential graded stable categories of symmetric algebras have negative Calabi-Yau dimension.
Perverse equivalences act transitively on bases in the dg-stable category of Brauer tree algebras.
The theory generalizes previous work from dimension -1 to arbitrary negative dimensions.
Abstract
Chuang and Rouquier describe an action by perverse equivalences on the set of bases of a triangulated category of Calabi-Yau dimension . We develop an analogue of their theory for Calabi-Yau categories of dimension and show it is equivalent to the mutation theory of -simple-minded systems. Given a non-positively graded, finite-dimensional symmetric algebra , we show that the differential graded stable category of has negative Calabi-Yau dimension. When is a Brauer tree algebra, we construct a combinatorial model of the dg-stable category and show that perverse equivalences act transitively on the set of -bases.
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 structures and combinatorial models · Advanced Topics in Algebra · Advanced Combinatorial Mathematics
