The Newton polytope and Lorentzian property of chromatic symmetric functions

{"title":"The Newton polytope and Lorentzian property of chromatic symmetric functions","authors":"","doi":"10.1007/s00029-024-00928-4","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>Chromatic symmetric functions are well-studied symmetric functions in algebraic combinatorics that generalize the chromatic polynomial and are related to Hessenberg varieties and diagonal harmonics. Motivated by the Stanley–Stembridge conjecture, we show that the allowable coloring weights for indifference graphs of Dyck paths are the lattice points of a permutahedron <span> <span>\\(\\mathcal {P}_\\lambda \\)</span> </span>, and we give a formula for the dominant weight <span> <span>\\(\\lambda \\)</span> </span>. Furthermore, we conjecture that such chromatic symmetric functions are Lorentzian, a property introduced by Brändén and Huh as a bridge between discrete convex analysis and concavity properties in combinatorics, and we prove this conjecture for abelian Dyck paths. We extend our results on the Newton polytope to incomparability graphs of <span> <span>\\((3+1)\\)</span> </span>-free posets, and we give a number of conjectures and results stemming from our work, including results on the complexity of computing the coefficients and relations with the <span> <span>\\(\\zeta \\)</span> </span> map from diagonal harmonics. </p>","PeriodicalId":501600,"journal":{"name":"Selecta Mathematica","volume":"25 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Selecta Mathematica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s00029-024-00928-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Chromatic symmetric functions are well-studied symmetric functions in algebraic combinatorics that generalize the chromatic polynomial and are related to Hessenberg varieties and diagonal harmonics. Motivated by the Stanley–Stembridge conjecture, we show that the allowable coloring weights for indifference graphs of Dyck paths are the lattice points of a permutahedron \(\mathcal {P}_\lambda \) , and we give a formula for the dominant weight \(\lambda \) . Furthermore, we conjecture that such chromatic symmetric functions are Lorentzian, a property introduced by Brändén and Huh as a bridge between discrete convex analysis and concavity properties in combinatorics, and we prove this conjecture for abelian Dyck paths. We extend our results on the Newton polytope to incomparability graphs of \((3+1)\) -free posets, and we give a number of conjectures and results stemming from our work, including results on the complexity of computing the coefficients and relations with the \(\zeta \) map from diagonal harmonics.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
牛顿多面体和色度对称函数的洛伦兹性质
摘要 色度对称函数是代数组合学中研究得很透彻的对称函数,它概括了色度多项式,并与海森堡变体和对角谐波有关。在斯坦利-斯坦布里奇猜想的激励下,我们证明了戴克路径的无差别图的允许着色权重是 permutahedron \(\mathcal {P}_\lambda \) 的晶格点,并给出了主导权重 \(\lambda \) 的公式。此外,我们猜想这种色度对称函数是洛伦兹性的,这是布兰登(Brändén)和胡(Huh)作为离散凸分析和组合学中凹性性质之间的桥梁而引入的性质,我们证明了非等边戴克路径的这一猜想。我们把关于牛顿多面体的结果扩展到了\((3+1)\)的不可比性图。-我们给出了一系列源自我们工作的猜想和结果,包括计算系数的复杂性以及与来自对角谐波的(\zeta \)映射的关系的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Parabolic recursions for Kazhdan–Lusztig polynomials and the hypercube decomposition Tomographic Fourier extension identities for submanifolds of $${\mathbb {R}}^n$$ The Morrison–Kawamata cone conjecture for singular symplectic varieties Colored vertex models and Iwahori Whittaker functions The module structure of a group action on a ring
×
引用
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