arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.04883math.RT

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

Toshiaki Shoji

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑