Combinatorics of the immaculate inverse Kostka matrix

Q3 Mathematics
N. Loehr, Elizabeth M. Niese
{"title":"Combinatorics of the immaculate inverse Kostka matrix","authors":"N. Loehr, Elizabeth M. Niese","doi":"10.5802/alco.193","DOIUrl":null,"url":null,"abstract":"The classical Kostka matrix counts semistandard tableaux and expands Schur symmetric functions in terms of monomial symmetric functions. The entries in the inverse Kostka matrix can be computed by various algebraic and combinatorial formulas involving determinants, special rim hook tableaux, raising operators, and tournaments. Our goal here is to develop an analogous combinatorial theory for the inverse of the immaculate Kostka matrix. The immaculate Kostka matrix enumerates dual immaculate tableaux and gives a combinatorial definition of the dual immaculate quasisymmetric functions Sα. We develop several formulas for the entries in the inverse of this matrix based on suitably generalized raising operators, tournaments, and special rim-hook tableaux. Our analysis reveals how the combinatorial conditions defining dual immaculate tableaux arise naturally from algebraic properties of raising operators. We also obtain an elementary combinatorial proof that the definition of Sα via dual immaculate tableaux is equivalent to the definition of the immaculate noncommutative symmetric functions Sα via noncommutative Jacobi–Trudi determinants. A factorization of raising operators leads to bases of NSym interpolating between the S-basis and the h-basis, and bases of QSym interpolating between the S∗-basis and the M -basis. We also give t-analogues for most of these results using combinatorial statistics defined on dual immaculate tableaux and tournaments.","PeriodicalId":36046,"journal":{"name":"Algebraic Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algebraic Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5802/alco.193","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 1

Abstract

The classical Kostka matrix counts semistandard tableaux and expands Schur symmetric functions in terms of monomial symmetric functions. The entries in the inverse Kostka matrix can be computed by various algebraic and combinatorial formulas involving determinants, special rim hook tableaux, raising operators, and tournaments. Our goal here is to develop an analogous combinatorial theory for the inverse of the immaculate Kostka matrix. The immaculate Kostka matrix enumerates dual immaculate tableaux and gives a combinatorial definition of the dual immaculate quasisymmetric functions Sα. We develop several formulas for the entries in the inverse of this matrix based on suitably generalized raising operators, tournaments, and special rim-hook tableaux. Our analysis reveals how the combinatorial conditions defining dual immaculate tableaux arise naturally from algebraic properties of raising operators. We also obtain an elementary combinatorial proof that the definition of Sα via dual immaculate tableaux is equivalent to the definition of the immaculate noncommutative symmetric functions Sα via noncommutative Jacobi–Trudi determinants. A factorization of raising operators leads to bases of NSym interpolating between the S-basis and the h-basis, and bases of QSym interpolating between the S∗-basis and the M -basis. We also give t-analogues for most of these results using combinatorial statistics defined on dual immaculate tableaux and tournaments.
完美逆Kostka矩阵的组合学
经典的Kostka矩阵计数半标准表,并将Schur对称函数扩展为单体对称函数。反Kostka矩阵中的条目可以通过各种代数和组合公式计算,包括行列式、特殊的边钩表、提升算子和锦标赛。我们的目标是为完美Kostka矩阵的逆发展一个类似的组合理论。完美Kostka矩阵列举了对偶完美表,给出了对偶完美拟对称函数Sα的组合定义。基于适当的广义提升算子、锦标赛和特殊的边钩表,我们为这个矩阵的逆项建立了几个公式。我们的分析揭示了定义对偶完美表的组合条件是如何从提升算子的代数性质中自然产生的。我们还得到了一个初等组合证明,即通过对偶完美表定义的Sα等价于通过非对易Jacobi–Trudi行列式定义的完美非对易对称函数Sα。提升算子的因子分解导致S基和h基之间的NSym插值的基,以及S*-基和M-基之间的QSym插值基。我们还使用定义在对偶完美表和锦标赛上的组合统计,给出了大多数结果的t-类似物。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Algebraic Combinatorics
Algebraic Combinatorics Mathematics-Discrete Mathematics and Combinatorics
CiteScore
1.30
自引率
0.00%
发文量
45
审稿时长
51 weeks
×
引用
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学术官方微信