Computing the Lusztig--Vogan Bijection
David B Rush

TL;DR
This paper provides a simplified combinatorial description of the Lusztig--Vogan bijection in type A, which relates bases of the derived category of $G$-equivariant sheaves on the nilpotent cone, improving upon previous algorithms.
Contribution
It introduces a new combinatorial method for computing the Lusztig--Vogan bijection in type A, simplifying and unifying prior algorithms.
Findings
Provides a simplified combinatorial description of the bijection.
Subsumes and improves upon Achar's algorithm.
Facilitates easier computation of the bijection in type A.
Abstract
Let be a connected complex reductive algebraic group with Lie algebra . The Lusztig--Vogan bijection relates two bases for the bounded derived category of -equivariant coherent sheaves on the nilpotent cone of . One basis is indexed by , the set of dominant weights of , and the other by , the set of pairs consisting of a nilpotent orbit and an irreducible -equivariant vector bundle . The existence of the Lusztig--Vogan bijection was proven by Bezrukavnikov, and an algorithm computing in type was given by Achar. Herein we present a combinatorial description of in type that subsumes and dramatically simplifies Achar's algorithm.
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
TopicsAdvanced Algebra and Geometry · Algebraic structures and combinatorial models · Advanced Combinatorial Mathematics
