{"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}
A Conjectured Formula for the Rational \(\varvec{q},\varvec{t}\)-Catalan Polynomial
We conjecture a formula for the rational q, t-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.