{"title":"有限归约群的广义格林函数和单能类","authors":"T. Shoji","doi":"10.1017/nmj.2021.12","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"GENERALIZED GREEN FUNCTIONS AND UNIPOTENT CLASSES FOR FINITE REDUCTIVE GROUPS, III\",\"authors\":\"T. Shoji\",\"doi\":\"10.1017/nmj.2021.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2021-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1017/nmj.2021.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1017/nmj.2021.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
GENERALIZED GREEN FUNCTIONS AND UNIPOTENT CLASSES FOR FINITE REDUCTIVE GROUPS, III
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
