Further enumeration results concerning a recent equivalence of restricted inversion sequences

T. Mansour, M. Shattuck
{"title":"Further enumeration results concerning a recent equivalence of restricted inversion sequences","authors":"T. Mansour, M. Shattuck","doi":"10.46298/dmtcs.8330","DOIUrl":null,"url":null,"abstract":"Let asc and desc denote respectively the statistics recording the number of ascents or descents in a sequence having non-negative integer entries. In a recent paper by Andrews and Chern, it was shown that the distribution of asc on the inversion sequence avoidance class $I_n(\\geq,\\neq,>)$ is the same as that of $n-1-\\text{asc}$ on the class $I_n(>,\\neq,\\geq)$, which confirmed an earlier conjecture of Lin. In this paper, we consider some further enumerative aspects related to this equivalence and, as a consequence, provide an alternative proof of the conjecture. In particular, we find recurrence relations for the joint distribution on $I_n(\\geq,\\neq,>)$ of asc and desc along with two other parameters, and do the same for $n-1-\\text{asc}$ and desc on $I_n(>,\\neq,\\geq)$. By employing a functional equation approach together with the kernel method, we are able to compute explicitly the generating function for both of the aforementioned joint distributions, which extends (and provides a new proof of) the recent result $|I_n(\\geq,\\neq,>)|=|I_n(>,\\neq,\\geq)|$. In both cases, an algorithm is formulated for computing the generating function of the asc distribution on members of each respective class having a fixed number of descents.","PeriodicalId":110830,"journal":{"name":"Discret. Math. Theor. Comput. Sci.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discret. Math. Theor. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/dmtcs.8330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Let asc and desc denote respectively the statistics recording the number of ascents or descents in a sequence having non-negative integer entries. In a recent paper by Andrews and Chern, it was shown that the distribution of asc on the inversion sequence avoidance class $I_n(\geq,\neq,>)$ is the same as that of $n-1-\text{asc}$ on the class $I_n(>,\neq,\geq)$, which confirmed an earlier conjecture of Lin. In this paper, we consider some further enumerative aspects related to this equivalence and, as a consequence, provide an alternative proof of the conjecture. In particular, we find recurrence relations for the joint distribution on $I_n(\geq,\neq,>)$ of asc and desc along with two other parameters, and do the same for $n-1-\text{asc}$ and desc on $I_n(>,\neq,\geq)$. By employing a functional equation approach together with the kernel method, we are able to compute explicitly the generating function for both of the aforementioned joint distributions, which extends (and provides a new proof of) the recent result $|I_n(\geq,\neq,>)|=|I_n(>,\neq,\geq)|$. In both cases, an algorithm is formulated for computing the generating function of the asc distribution on members of each respective class having a fixed number of descents.
关于限制反转序列最近等价的进一步枚举结果
令asc和desc分别表示记录在具有非负整数项的序列中上升或下降次数的统计量。Andrews和Chern在最近的一篇论文中,证明了asc在反转序列规避类$I_n(\geq,\neq,>)$上的分布与$n-1-\text{asc}$在$I_n(>,\neq,\geq)$类上的分布相同,这证实了Lin之前的一个猜想。在本文中,我们进一步考虑了与这个等价有关的一些枚举方面,并因此提供了这个猜想的另一种证明。特别是,我们找到了asc和desc与其他两个参数在$I_n(\geq,\neq,>)$上的联合分布的递归关系,并对$I_n(>,\neq,\geq)$上的$n-1-\text{asc}$和desc做了同样的处理。通过将函数方程方法与核方法结合使用,我们能够显式地计算上述两个联合分布的生成函数,这扩展了最近的结果$|I_n(\geq,\neq,>)|=|I_n(>,\neq,\geq)|$(并提供了新的证明)。在这两种情况下,制定了一种算法,用于计算具有固定数量下降的每个各自类的成员的asc分布的生成函数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信