No CrossRef data available.
Article contents
GENERALIZED GREEN FUNCTIONS AND UNIPOTENT CLASSES FOR FINITE REDUCTIVE GROUPS, III
Published online by Cambridge University Press: 03 September 2021
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.
MSC classification
- Type
- Article
- Information
- Copyright
- © (2021) The Authors. The publishing rights in this article are licenced to Foundation Nagoya Mathematical Journal under an exclusive license