GENERALIZED GREEN FUNCTIONS AND UNIPOTENT CLASSES FOR FINITE REDUCTIVE GROUPS, III
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 a...
Saved in:
Published in | Nagoya mathematical journal Vol. 247; pp. 552 - 573 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Cambridge, UK
Cambridge University Press
01.09.2022
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISSN: | 0027-7630 2152-6842 |
DOI: | 10.1017/nmj.2021.12 |