关于钩形的$$\frac{n!}{2}$$猜想的证明

IF 0.6 4区 数学 Q4 MATHEMATICS, APPLIED Annals of Combinatorics Pub Date : 2022-10-20 DOI:10.1007/s00026-022-00613-3
Sam Armon
{"title":"关于钩形的$$\\frac{n!}{2}$$猜想的证明","authors":"Sam Armon","doi":"10.1007/s00026-022-00613-3","DOIUrl":null,"url":null,"abstract":"<div><p>A well-known representation-theoretic model for the transformed Macdonald polynomial <span>\\({\\widetilde{H}}_\\mu (Z;t,q)\\)</span>, where <span>\\(\\mu \\)</span> is an integer partition, is given by the Garsia–Haiman module <span>\\({\\mathcal {H}}_\\mu \\)</span>. We study the <span>\\(\\frac{n!}{k}\\)</span> conjecture of Bergeron and Garsia, which concerns the behavior of certain <i>k</i>-tuples of Garsia–Haiman modules under intersection. In the special case that <span>\\(\\mu \\)</span> has hook shape, we use a basis for <span>\\({\\mathcal {H}}_\\mu \\)</span> due to Adin, Remmel, and Roichman to resolve the <span>\\(\\frac{n!}{2}\\)</span> conjecture by constructing an explicit basis for the intersection of two Garsia–Haiman modules.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2022-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00026-022-00613-3.pdf","citationCount":"1","resultStr":"{\"title\":\"A Proof of the \\\\(\\\\frac{n!}{2}\\\\) Conjecture for Hook Shapes\",\"authors\":\"Sam Armon\",\"doi\":\"10.1007/s00026-022-00613-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A well-known representation-theoretic model for the transformed Macdonald polynomial <span>\\\\({\\\\widetilde{H}}_\\\\mu (Z;t,q)\\\\)</span>, where <span>\\\\(\\\\mu \\\\)</span> is an integer partition, is given by the Garsia–Haiman module <span>\\\\({\\\\mathcal {H}}_\\\\mu \\\\)</span>. We study the <span>\\\\(\\\\frac{n!}{k}\\\\)</span> conjecture of Bergeron and Garsia, which concerns the behavior of certain <i>k</i>-tuples of Garsia–Haiman modules under intersection. In the special case that <span>\\\\(\\\\mu \\\\)</span> has hook shape, we use a basis for <span>\\\\({\\\\mathcal {H}}_\\\\mu \\\\)</span> due to Adin, Remmel, and Roichman to resolve the <span>\\\\(\\\\frac{n!}{2}\\\\)</span> conjecture by constructing an explicit basis for the intersection of two Garsia–Haiman modules.</p></div>\",\"PeriodicalId\":50769,\"journal\":{\"name\":\"Annals of Combinatorics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00026-022-00613-3.pdf\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00026-022-00613-3\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-022-00613-3","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 1

摘要

Garsia–Haiman模({\mathcal{H}}_\mu\)给出了一个著名的变换Macdonald多项式({\widetilde{H}}_\ mu(Z;t,q)\)的表示论模型,其中\(\ mu\)是一个整数分区。我们研究了Bergeron和Garsia的\(frac{n!}{k}\)猜想,它涉及Garsia–Haiman模的某些k元组在交集下的行为。在\(\mu\)具有钩形的特殊情况下,我们使用由Adin、Remmel和Roichman引起的\({\mathcal{H}}_\mu\。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Proof of the \(\frac{n!}{2}\) Conjecture for Hook Shapes

A well-known representation-theoretic model for the transformed Macdonald polynomial \({\widetilde{H}}_\mu (Z;t,q)\), where \(\mu \) is an integer partition, is given by the Garsia–Haiman module \({\mathcal {H}}_\mu \). We study the \(\frac{n!}{k}\) conjecture of Bergeron and Garsia, which concerns the behavior of certain k-tuples of Garsia–Haiman modules under intersection. In the special case that \(\mu \) has hook shape, we use a basis for \({\mathcal {H}}_\mu \) due to Adin, Remmel, and Roichman to resolve the \(\frac{n!}{2}\) conjecture by constructing an explicit basis for the intersection of two Garsia–Haiman modules.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Annals of Combinatorics
Annals of Combinatorics 数学-应用数学
CiteScore
1.00
自引率
0.00%
发文量
56
审稿时长
>12 weeks
期刊介绍: Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board. The scope of Annals of Combinatorics is covered by the following three tracks: Algebraic Combinatorics: Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices Analytic and Algorithmic Combinatorics: Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms Graphs and Matroids: Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches
期刊最新文献
Efficient Representation of Lattice Path Matroids Partitions with Fixed Points in the Sequence of First-Column Hook Lengths Acyclic Reorientation Lattices and Their Lattice Quotients A Multiparameter Refinement of Euler’s Theorem On the Support of Grothendieck Polynomials
×
引用
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