2-stack sortable permutations with a given number of runs

MaRDI QIDQ6502460arXivFDO

Authors Miklós Bóna

Published in arXiv

Abstract: Using earlier results we prove a formula for the number $W_{(n,k)}$ of 2-stack sortable permutations of length $n$ with $k$ runs, or in other words, $k-1$ descents. This formula will yield the suprising fact that there are as many 2-stack sortable permutations with $k-1$ descents as with $k-1$ ascents. We also prove that $W_{(n,k)}$ is unimodal in $k$, for any fixed $n$.

This page was built for publication: 2-stack sortable permutations with a given number of runs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6502460)