当前位置: X-MOL 学术arXiv.cs.DM › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Refined Wilf-equivalences by Comtet statistics
arXiv - CS - Discrete Mathematics Pub Date : 2020-09-09 , DOI: arxiv-2009.04269
Shishuo Fu, Zhicong Lin, Yaling Wang

We launch a systematic study of the refined Wilf-equivalences by the statistics $\mathsf{comp}$ and $\mathsf{iar}$, where $\mathsf{comp}(\pi)$ and $\mathsf{iar}(\pi)$ are the number of components and the length of the initial ascending run of a permutation $\pi$, respectively. As Comtet was the first one to consider the statistic $\mathsf{comp}$ in his book {\em Analyse combinatoire}, any statistic equidistributed with $\mathsf{comp}$ over a class of permutations is called by us a {\em Comtet statistic} over such class. This work is motivated by a triple equidistribution result of Rubey on $321$-avoiding permutations, and a recent result of the first and third authors that $\mathsf{iar}$ is a Comtet statistic over separable permutations. Some highlights of our results are: (1) Bijective proofs of the symmetry of the double Comtet distribution $(\mathsf{comp},\mathsf{iar})$ over several Catalan and Schr\"oder classes, preserving the values of the left-to-right maxima. (2) A complete classification of $\mathsf{comp}$- and $\mathsf{iar}$-Wilf-equivalences for length $3$ patterns and pairs of length $3$ patterns. Calculations of the $(\mathsf{des},\mathsf{iar},\mathsf{comp})$ generating functions over these pattern avoiding classes and separable permutations. (3) A further refinement by the Comtet statistic $\mathsf{iar}$, of Wang's recent descent-double descent-Wilf equivalence between separable permutations and $(2413,4213)$-avoiding permutations.

中文翻译:

通过 Comtet 统计精炼的 Wilf 等价

我们通过统计 $\mathsf{comp}$ 和 $\mathsf{iar}$ 对精炼的 Wilf 等价进行系统研究,其中 $\mathsf{comp}(\pi)$ 和 $\mathsf{iar}( \pi)$ 分别是排列 $\pi$ 的分量数和初始升序运行的长度。由于 Comtet 是第一个在他的著作 {\em Analyze combinatoire} 中考虑统计量 $\mathsf{comp}$ 的人,所以任何在一类排列上与 $\mathsf{comp}$ 等分的统计量都被我们称为 {\ em Comtet statistic} 超过此类。这项工作的动机是 Rubey 在 $321$-avoiding permutations 上的三重均衡分布结果,以及第一和第三作者的最新结果,即 $\mathsf{iar}$ 是可分离排列的 Comtet 统计量。我们结果的一些亮点是:(2) 长度$3$模式和长度$3$模式对的$\mathsf{comp}$-和$\mathsf{iar}$-Wilf-等价的完整分类。在这些模式上计算 $(\mathsf{des},\mathsf{iar},\mathsf{comp})$ 生成函数,避免类和可分离排列。(3) Comtet 统计 $\mathsf{iar}$ 的进一步改进,Wang 最近的下降双下降 - 可分离排列和 $(2413,4213)$-避免排列之间的威尔夫等价。(2) 长度$3$模式和长度$3$模式对的$\mathsf{comp}$-和$\mathsf{iar}$-Wilf-等价的完整分类。在这些模式上计算 $(\mathsf{des},\mathsf{iar},\mathsf{comp})$ 生成函数,避免类和可分离排列。(3) Comtet 统计 $\mathsf{iar}$ 的进一步改进,Wang 最近的下降双下降 - 可分离排列和 $(2413,4213)$-避免排列之间的威尔夫等价。
更新日期:2020-09-10
down
wechat
bug