Matrix factorizations of the discriminant of Sn

IF 1.1 4区 数学 Q4 COMPUTER SCIENCE, THEORY & METHODS Journal of Symbolic Computation Pub Date : 2024-02-23 DOI:10.1016/j.jsc.2024.102310
Eleonore Faber , Colin Ingalls , Simon May , Marco Talarico
{"title":"Matrix factorizations of the discriminant of Sn","authors":"Eleonore Faber ,&nbsp;Colin Ingalls ,&nbsp;Simon May ,&nbsp;Marco Talarico","doi":"10.1016/j.jsc.2024.102310","DOIUrl":null,"url":null,"abstract":"<div><p>Consider the symmetric group <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> acting as a reflection group on the polynomial ring <span><math><mi>k</mi><mo>[</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>]</mo></math></span> where <em>k</em> is a field, such that Char(<em>k</em>) does not divide <em>n</em>!. We use Higher Specht polynomials to construct matrix factorizations of the discriminant of this group action: these matrix factorizations are indexed by partitions of <em>n</em> and respect the decomposition of the coinvariant algebra into isotypical components. The maximal Cohen–Macaulay modules associated to these matrix factorizations give rise to a noncommutative resolution of the discriminant and they correspond to the nontrivial irreducible representations of <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. All our constructions are implemented in Macaulay2 and we provide several examples. We also discuss extensions of these results to Young subgroups of <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> and indicate how to generalize them to the reflection groups <span><math><mi>G</mi><mo>(</mo><mi>m</mi><mo>,</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>)</mo></math></span>.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"125 ","pages":"Article 102310"},"PeriodicalIF":1.1000,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0747717124000142/pdfft?md5=688baaec9b10f27e6369b86c65d8e101&pid=1-s2.0-S0747717124000142-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0747717124000142","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Consider the symmetric group Sn acting as a reflection group on the polynomial ring k[x1,,xn] where k is a field, such that Char(k) does not divide n!. We use Higher Specht polynomials to construct matrix factorizations of the discriminant of this group action: these matrix factorizations are indexed by partitions of n and respect the decomposition of the coinvariant algebra into isotypical components. The maximal Cohen–Macaulay modules associated to these matrix factorizations give rise to a noncommutative resolution of the discriminant and they correspond to the nontrivial irreducible representations of Sn. All our constructions are implemented in Macaulay2 and we provide several examples. We also discuss extensions of these results to Young subgroups of Sn and indicate how to generalize them to the reflection groups G(m,1,n).

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
S 判别式的矩阵因式分解
考虑对称群 Sn 作为反射群作用于多项式环 k[x1,...xn] (其中 k 是一个域),使得 Char(k) 不除 n!。我们使用高斯佩希特多项式来构造这个群作用的判别式的矩阵因式分解:这些矩阵因式分解以 n 的分区为索引,并尊重共变代数分解为同型成分的原则。与这些矩阵因式化相关的最大科恩-麦考莱模块产生了判别式的非交换解析,它们对应于 Sn 的非琐不可还原表示。我们的所有构造都在 Macaulay2 中实现,并提供了几个例子。我们还讨论了将这些结果扩展到 Sn 的 Young 子群,并指出如何将它们推广到反射群 G(m,1,n)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Symbolic Computation
Journal of Symbolic Computation 工程技术-计算机:理论方法
CiteScore
2.10
自引率
14.30%
发文量
75
审稿时长
142 days
期刊介绍: An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects. It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.
期刊最新文献
Supercongruences involving products of two binomial coefficients modulo p4 A field-theoretic view of unlabeled sensing Explicit desingularisation of Kummer surfaces in characteristic two via specialisation Computing the character table of a 2-local maximal subgroup of the Monster Editorial Board
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1