Classifying descents according to parity
From MaRDI portal
Publication:2385102
DOI10.1007/S00026-007-0313-2zbMATH Open1126.05016arXivmath/0508570OpenAlexW2133236853MaRDI QIDQ2385102FDOQ2385102
Authors: Sergey Kitaev, Jeffrey Remmel
Publication date: 11 October 2007
Published in: Annals of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/0508570
Recommendations
Cited In (12)
- Cycles of even-odd drop permutations and continued fractions of Genocchi numbers
- Enumeration of Dumont permutations avoiding certain four-letter patterns
- Parity permutation pattern matching
- Classifying descents according to equivalence \(\operatorname{mod} k\)
- Equidistribution of descents, adjacent pairs, and place-value pairs on permutations
- Rook-by-rook rook theory: Bijective proofs of rook and hit equivalences
- Using the Entringer numbers to count the alternating permutations according a new parameter
- Enumeration of permutations by the parity of descent positions
- Parity alternating permutations starting with an odd integer
- Counting descent pairs with prescribed tops and bottoms
- The homogenized Linial arrangement and Genocchi numbers
- Statistics on permutations
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)