arXiv Analytics

Sign in

arXiv:2004.04883 [math.RT]AbstractReferencesReviewsResources

Generalized Green functions and unipotent classes for finite reductive groups, III

Toshiaki Shoji

Published 2020-04-10Version 1

Lusztig's algorithm of computing generalized Green functions of reductive groups involves an ambiguity of certain scalars. In this paper, for reductive groups of classical type with arbitrary characteristic, we determine those scalars explicitly, and eliminate the ambiguity. Our results imply that all the generalized Green functions of classical type are computable.

Comments: 25 pages
Categories: math.RT
Subjects: 20G05, 20G40
Related articles: Most relevant | Search more
arXiv:math/0611415 [math.RT] (Published 2006-11-14)
Generalized Green functions and unipotent classes for finite reductive groups, II
arXiv:2408.16960 [math.RT] (Published 2024-08-30)
Generalized Green functions and unipotent classes for finite reductive groups, IV
arXiv:math/0507057 [math.RT] (Published 2005-07-04)
Generalized Green functions and unipotent classes for finite reductive groups, I

Links

Toolbox