GENERALIZED GREEN FUNCTIONS AND UNIPOTENT CLASSES FOR FINITE REDUCTIVE GROUPS, III
Abstract Lusztig’s algorithm of computing generalized Green functions of reductive groups involves an ambiguity on 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.
2007 ◽
Vol 188
◽
pp. 133-170
◽
Keyword(s):
2006 ◽
Vol 184
◽
pp. 155-198
◽
Keyword(s):
Keyword(s):
2019 ◽
Vol 15
(3)
◽
pp. 172-173
◽