The generalized Gelfand–Graev characters of GLn(Fq)

Scott Andrews, N. Thiem
{"title":"The generalized Gelfand–Graev characters of GLn(Fq)","authors":"Scott Andrews, N. Thiem","doi":"10.46298/dmtcs.6406","DOIUrl":null,"url":null,"abstract":"International audience\n \n Introduced by Kawanaka in order to find the unipotent representations of finite groups of Lie type, gener- alized Gelfand–Graev characters have remained somewhat mysterious. Even in the case of the finite general linear groups, the combinatorics of their decompositions has not been worked out. This paper re-interprets Kawanaka's def- inition in type A in a way that gives far more flexibility in computations. We use these alternate constructions to show how to obtain generalized Gelfand–Graev representations directly from the maximal unipotent subgroups. We also explicitly decompose the corresponding generalized Gelfand–Graev characters in terms of unipotent representations, thereby recovering the Kostka–Foulkes polynomials as multiplicities.\n","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2016-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Theoretical Computer Science","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.46298/dmtcs.6406","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

International audience Introduced by Kawanaka in order to find the unipotent representations of finite groups of Lie type, gener- alized Gelfand–Graev characters have remained somewhat mysterious. Even in the case of the finite general linear groups, the combinatorics of their decompositions has not been worked out. This paper re-interprets Kawanaka's def- inition in type A in a way that gives far more flexibility in computations. We use these alternate constructions to show how to obtain generalized Gelfand–Graev representations directly from the maximal unipotent subgroups. We also explicitly decompose the corresponding generalized Gelfand–Graev characters in terms of unipotent representations, thereby recovering the Kostka–Foulkes polynomials as multiplicities.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
GLn(Fq)的广义Gelfand-Graev性质
由川中介绍,为了寻找李型有限群的单能表示,一般化的Gelfand-Graev字符一直有些神秘。即使在有限一般线性群的情况下,其分解的组合学也没有得到解决。本文在A型中重新解释了Kawanaka的定义,使其在计算中具有更大的灵活性。我们使用这些交替结构来说明如何直接从极大单幂子群中得到广义Gelfand-Graev表示。我们还显式地将相应的广义Gelfand-Graev特征分解为幂偶表示,从而将Kostka-Foulkes多项式恢复为多重多项式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
14.30%
发文量
39
期刊介绍: DMTCS is a open access scientic journal that is online since 1998. We are member of the Free Journal Network. Sections of DMTCS Analysis of Algorithms Automata, Logic and Semantics Combinatorics Discrete Algorithms Distributed Computing and Networking Graph Theory.
期刊最新文献
Bears with Hats and Independence Polynomials Pseudoperiodic Words and a Question of Shevelev Gossiping with interference in radio ring networks Dissecting power of intersection of two context-free languages Embedding phylogenetic trees in networks of low treewidth
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1