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 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 t...

Full description

Saved in:
Bibliographic Details
Main Author Shoji, Toshiaki
Format Journal Article
LanguageEnglish
Published 09.04.2020
Subjects
Mathematics - Representation Theory
Online AccessGet full text

Cover

More Information
Summary: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.
DOI:10.48550/arxiv.2004.04883