GENERALIZED GREEN FUNCTIONS AND UNIPOTENT CLASSES FOR FINITE REDUCTIVE GROUPS, III
-
Published:2021-09-03
Issue:
Volume:
Page:1-22
-
ISSN:0027-7630
-
Container-title:Nagoya Mathematical Journal
-
language:en
-
Short-container-title:Nagoya Math. J.
Abstract
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.
Publisher
Cambridge University Press (CUP)
Subject
General Mathematics