Return to search

Computing the Lusztig-Vogan bijection

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2017. / Cataloged from PDF version of thesis. / Includes bibliographical references (pages 129-130). / Let G be a connected complex reductive algebraic group with Lie algebra g. The Lusztig-Vogan bijection relates two bases for the bounded derived category of G-equivariant coherent sheaves on the nilpotent cone 11 of g. One basis is indexed by ..., the set of dominant weights of G, and the other by [Omega], the set of pairs ... consisting of a nilpotent orbit ... and an irreducible G-equivariant vector bundle ... The existence of the Lusztig-Vogan bijection ... was proven by Bezrukavnikov, and an algorithm computing [gamma] in type A was given by Achar. Herein we present a combinatorial description of [gamma] in type A that subsumes and dramatically simplifies Achar's algorithm. / by David B Rush. / Ph. D.

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/113549
Date January 2017
CreatorsRush, David B., Ph. D. Massachusetts Institute of Technology
ContributorsDavid A. Vogan Jr., Massachusetts Institute of Technology. Department of Mathematics., Massachusetts Institute of Technology. Department of Mathematics.
PublisherMassachusetts Institute of Technology
Source SetsM.I.T. Theses and Dissertation
LanguageEnglish
Detected LanguageEnglish
TypeThesis
Format130 pages, application/pdf
RightsMIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission., http://dspace.mit.edu/handle/1721.1/7582

Page generated in 0.0017 seconds