有理$$\varvec{q},\varvec{t}$$-Catalan多项式的一个猜想公式

Pub Date : 2023-09-07 DOI:10.1007/s00026-023-00662-2
Graham Hawkes
{"title":"有理$$\\varvec{q},\\varvec{t}$$-Catalan多项式的一个猜想公式","authors":"Graham Hawkes","doi":"10.1007/s00026-023-00662-2","DOIUrl":null,"url":null,"abstract":"<div><p>We conjecture a formula for the rational <i>q</i>, <i>t</i>-Catalan polynomial <span>\\({\\mathcal {C}}_{r/s}\\)</span> that is symmetric in <i>q</i> and <i>t</i> by definition. The conjecture posits that <span>\\({\\mathcal {C}}_{r/s}\\)</span> can be written in terms of symmetric monomial strings indexed by maximal Dyck paths. We show that for any finite <span>\\(d^*\\)</span>, giving a combinatorial proof of our conjecture on the infinite set of functions <span>\\(\\{ {\\mathcal {C}}_{r/s}^d: r\\equiv 1 \\mod s, \\,\\,\\, d \\le d^*\\}\\)</span> is equivalent to a finite counting problem.</p></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Conjectured Formula for the Rational \\\\(\\\\varvec{q},\\\\varvec{t}\\\\)-Catalan Polynomial\",\"authors\":\"Graham Hawkes\",\"doi\":\"10.1007/s00026-023-00662-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We conjecture a formula for the rational <i>q</i>, <i>t</i>-Catalan polynomial <span>\\\\({\\\\mathcal {C}}_{r/s}\\\\)</span> that is symmetric in <i>q</i> and <i>t</i> by definition. The conjecture posits that <span>\\\\({\\\\mathcal {C}}_{r/s}\\\\)</span> can be written in terms of symmetric monomial strings indexed by maximal Dyck paths. We show that for any finite <span>\\\\(d^*\\\\)</span>, giving a combinatorial proof of our conjecture on the infinite set of functions <span>\\\\(\\\\{ {\\\\mathcal {C}}_{r/s}^d: r\\\\equiv 1 \\\\mod s, \\\\,\\\\,\\\\, d \\\\le d^*\\\\}\\\\)</span> is equivalent to a finite counting problem.</p></div>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2023-09-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00026-023-00662-2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-023-00662-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们猜想了有理 q,t-卡塔兰多项式 \({\mathcal {C}}_{r/s}\) 的公式,根据定义,它在 q 和 t 中是对称的。这个猜想认为 \({\mathcal {C}}_{r/s}\) 可以用最大戴克路径索引的对称单项式串来写。我们证明,对于任何有限的(d^*\),给出我们关于无限函数集 \(\{{mathcal {C}_{r/s}^d: r\equiv 1 \mod s, \,\,\, d \le d^*\}) 的猜想的组合证明等价于一个有限计数问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
A Conjectured Formula for the Rational \(\varvec{q},\varvec{t}\)-Catalan Polynomial

We conjecture a formula for the rational qt-Catalan polynomial \({\mathcal {C}}_{r/s}\) that is symmetric in q and t by definition. The conjecture posits that \({\mathcal {C}}_{r/s}\) can be written in terms of symmetric monomial strings indexed by maximal Dyck paths. We show that for any finite \(d^*\), giving a combinatorial proof of our conjecture on the infinite set of functions \(\{ {\mathcal {C}}_{r/s}^d: r\equiv 1 \mod s, \,\,\, d \le d^*\}\) is equivalent to a finite counting problem.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
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