Generalized Green functions and unipotent classes for finite reductive groups, III

2020/04/10 by Shoji, Toshiaki
#20G05 #20G40 #FOS: Mathematics #Representation Theory (math.RT)

paper · doi:10.48550/arxiv.2004.04883

Abstract

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.

Related

• Generalized Green functions and unipotent classes for finite reductive groups, II
• Generalized Green functions and unipotent classes for finite reductive groups, I
• Remarks on computing Green functions
• Generalized Green functions and unipotent classes for finite reductive groups, IV
• The space of unipotently supported class functions on a finite reductive group