






















Let $\mathcal I_n$ and $\mathcal J_n$ denote the set of involutions and fixed-point free involutions of $\{1, \dots, n\}$, respectively, and let $\text{des}(π)$ denote the number of descents of the permutation $π$. We prove a conjecture of Guo and Zeng which states that $I_n(t) := \sum_{π\in \mathcal I_n} t^{\text{des}(π)}$ is $γ$-positive for $n \ge 1$ and $J_{2n}(t) := \sum_{π\in \mathcal J_{2n}} t^{\text{des}(π)}$ is $γ$-positive for $n \ge 9$. We also prove that the number of $(3412, 3421)$-avoiding permutations with $m$ double descents and $k$ descents is equal to the number of separable permutations with $m$ double descents and $k$ descents.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。