Classifying descents according to parity

From MaRDI portal
Publication:2385102



Abstract: In this paper we refine the well-known permutation statistic "descent" by fixing parity of (exactly) one of the descent's numbers. We provide explicit formulas for the distribution of these (four) new statistics. We use certain differential operators to obtain the formulas. Moreover, we discuss connection of our new statistics to the Genocchi numbers. We also provide bijective proofs of some of our results.


The pair \(\pi_{i}\pi_{i+1}\) is called a descent of the permutation \(\pi=\pi_1\pi_2\ldots\pi_n\) if \(\pi_i>\pi_{i+1}\). The authors study the distribution of descents over \(S_n\) depending on the parity of either \(\pi_i\) or \(\pi_{i+1}\). Using certain differential operators (and trivial symmetries between permutations) they provide explicit formulas for the number of permutations in \(S_n\) having exactly \(k\) descents which begin/end with an even/odd number.











This page was built for publication: Classifying descents according to parity

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