Parity statistics on restricted permutations and the Catalan–Schett polynomials

IF 1.2 2区 数学 Q2 MATHEMATICS Journal of Combinatorial Theory Series A Pub Date : 2025-10-01 Epub Date: 2025-04-03 DOI:10.1016/j.jcta.2025.106049
Zhicong Lin , Jing Liu , Sherry H.F. Yan
{"title":"Parity statistics on restricted permutations and the Catalan–Schett polynomials","authors":"Zhicong Lin ,&nbsp;Jing Liu ,&nbsp;Sherry H.F. Yan","doi":"10.1016/j.jcta.2025.106049","DOIUrl":null,"url":null,"abstract":"<div><div>Motivated by Kitaev and Zhang's recent work on non-overlapping ascents in stack-sortable permutations and Dumont's permutation interpretation of the Jacobi elliptic functions, we investigate some parity statistics on restricted permutations. Some new related bijections are constructed and two refinements of the generating function for descents over 321-avoiding permutations due to Barnabei, Bonetti and Silimbanian are obtained. In particular, an open problem of Kitaev and Zhang about non-overlapping ascents on 321-avoiding permutations is solved and several combinatorial interpretations for the Catalan–Schett polynomials are found. The stack-sortable permutations are at the heart of our approaches.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"215 ","pages":"Article 106049"},"PeriodicalIF":1.2000,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316525000445","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/4/3 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Motivated by Kitaev and Zhang's recent work on non-overlapping ascents in stack-sortable permutations and Dumont's permutation interpretation of the Jacobi elliptic functions, we investigate some parity statistics on restricted permutations. Some new related bijections are constructed and two refinements of the generating function for descents over 321-avoiding permutations due to Barnabei, Bonetti and Silimbanian are obtained. In particular, an open problem of Kitaev and Zhang about non-overlapping ascents on 321-avoiding permutations is solved and several combinatorial interpretations for the Catalan–Schett polynomials are found. The stack-sortable permutations are at the heart of our approaches.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
限制置换和Catalan-Schett多项式的奇偶统计
在Kitaev和Zhang最近关于堆可排序排列的非重叠上升和Jacobi椭圆函数的Dumont的排列解释的启发下,我们研究了一些限制排列的宇称统计。构造了一些新的相关双射,并得到了Barnabei、Bonetti和Silimbanian的321-avoid排列下降生成函数的两个改进。特别地,我们解决了Kitaev和Zhang关于321-avoid置换上的非重叠上升的开放问题,并找到了Catalan-Schett多项式的几种组合解释。堆栈排序排列是我们方法的核心。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.90
自引率
9.10%
发文量
94
审稿时长
12 months
期刊介绍: The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.
期刊最新文献
Focal-free uniform hypergraphs and codes Scarf complexes of graphs and their powers On the smallest antichain that generates an ideal of a given size Exponentiable linear orders need not be transitive Bounding the parameter β of a distance-regular graph with classical parameters
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1