莫线对合和晶体同构

IF 0.9 2区 数学 Q2 MATHEMATICS
Nicolas Jacon
{"title":"莫线对合和晶体同构","authors":"Nicolas Jacon","doi":"10.5070/c63261986","DOIUrl":null,"url":null,"abstract":"We develop a new approach for the computation of the Mullineux involution for the symmetric group and its Hecke algebra using the notion of crystal isomorphism and the Iwahori-Matsumoto involution for the affine Hecke algebra of type \\(A\\). As a consequence, we obtain several new elementary combinatorial algorithms for its computation, one of which is equivalent to Xu algorithm (and thus Mullineux original algorithm). We thus obtain a simple interpretation of these algorithms and a new elementary proof that they indeed compute the Mullineux involution.Mathematics Subject Classifications: 20C08, 05E10Keywords: Symmetric group, Mullineux involution, crystal graph","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2023-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Mullineux involution and crystal isomorphisms\",\"authors\":\"Nicolas Jacon\",\"doi\":\"10.5070/c63261986\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We develop a new approach for the computation of the Mullineux involution for the symmetric group and its Hecke algebra using the notion of crystal isomorphism and the Iwahori-Matsumoto involution for the affine Hecke algebra of type \\\\(A\\\\). As a consequence, we obtain several new elementary combinatorial algorithms for its computation, one of which is equivalent to Xu algorithm (and thus Mullineux original algorithm). We thus obtain a simple interpretation of these algorithms and a new elementary proof that they indeed compute the Mullineux involution.Mathematics Subject Classifications: 20C08, 05E10Keywords: Symmetric group, Mullineux involution, crystal graph\",\"PeriodicalId\":50230,\"journal\":{\"name\":\"Journal of Combinatorial Theory Series A\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-09-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory Series A\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5070/c63261986\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5070/c63261986","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

摘要

利用晶体同构的概念和\(A\)型仿射Hecke代数的Iwahori-Matsumoto对合,提出了计算对称群及其Hecke代数的Mullineux对合的新方法。因此,我们得到了几种新的计算初等组合算法,其中一种算法等价于Xu算法(即Mullineux原始算法)。因此,我们得到了这些算法的一个简单的解释和一个新的初等证明,证明它们确实计算了Mullineux对合。关键词:对称群,莫线对合,晶体图
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mullineux involution and crystal isomorphisms
We develop a new approach for the computation of the Mullineux involution for the symmetric group and its Hecke algebra using the notion of crystal isomorphism and the Iwahori-Matsumoto involution for the affine Hecke algebra of type \(A\). As a consequence, we obtain several new elementary combinatorial algorithms for its computation, one of which is equivalent to Xu algorithm (and thus Mullineux original algorithm). We thus obtain a simple interpretation of these algorithms and a new elementary proof that they indeed compute the Mullineux involution.Mathematics Subject Classifications: 20C08, 05E10Keywords: Symmetric group, Mullineux involution, crystal graph
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.90
自引率
9.10%
发文量
94
审稿时长
12 months
期刊介绍: The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信