当前位置:
X-MOL 学术
›
J. Comb. Theory A
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Lattice paths and (n − 2)-stack sortable permutations
Journal of Combinatorial Theory Series A ( IF 0.9 ) Pub Date : 2022-04-06 , DOI: 10.1016/j.jcta.2022.105622 Cindy C.Y. Gu 1 , Larry X.W. Wang 2
中文翻译:
格路径和 (n − 2)-stack 可排序排列
更新日期:2022-04-06
Journal of Combinatorial Theory Series A ( IF 0.9 ) Pub Date : 2022-04-06 , DOI: 10.1016/j.jcta.2022.105622 Cindy C.Y. Gu 1 , Larry X.W. Wang 2
Affiliation
We establish a bijection between the -stack sortable permutations and the labeled lattice paths. Using this bijection, we directly give combinatorial proof for the log-concavity of the numbers of -stack sortable permutations with k descents. Furthermore, we prove the numbers of -stack sortable permutations with k descents satisfy interlacing log-concavity. We also consider a conjecture proposed by Bóna that the sequences of the descents of t-stack sortable permutations of are Hilbert functions for any t and n. We prove this conjecture for .
中文翻译:
格路径和 (n − 2)-stack 可排序排列
我们在-stack 可排序排列和标记的格子路径。使用这个双射,我们直接给出了数的对数凹度的组合证明-stack 具有k个下降的可排序排列。此外,我们证明了具有k个下降的堆栈可排序排列满足交错对数凹度。我们还考虑了 Bóna 提出的一个猜想,即t -stack 可排序排列的下降序列是任何t和n的希尔伯特函数。我们证明这个猜想为.