Classifying descents according to equivalence mod k
From MaRDI portal
Publication:2500983
Abstract: In [S. Kitaev and J. Remmel: Classifying descents according to parity] the authors refine the well-known permutation statistic "descent" by fixing parity of (exactly) one of the descent's numbers. In this paper, we generalize the results of [S. Kitaev and J. Remmel: Classifying descents according to parity] by studying descents according to whether the first or the second element in a descent pair is equivalent to mod . We provide either an explicit or an inclusion-exclusion type formula for the distribution of the new statistics. Based on our results we obtain combinatorial proofs of a number of remarkable identities. We also provide bijective proofs of some of our results and state a number of open problems.
Recommendations
- Classifying descents according to parity
- Counting descents and ascents relative to equivalence classes mod \(k\)
- Equivalence classes of permutations modulo descents and left-to-right maxima
- Equidistribution of descents, adjacent pairs, and place-value pairs on permutations
- On counting permutations by pairs of congruence classes of major index
Cited in
(9)- Counting descents, rises, and levels, with prescribed first element, in words
- Enumeration of Dumont permutations avoiding certain four-letter patterns
- Classifying descents according to parity
- The homogenized linial arrangement and Genocchi numbers
- Equivalence classes of permutations modulo descents and left-to-right maxima
- Equidistribution of descents, adjacent pairs, and place-value pairs on permutations
- The combinatorics of Jeff Remmel
- Counting descent pairs with prescribed tops and bottoms
- Counting descents and ascents relative to equivalence classes mod \(k\)
This page was built for publication: Classifying descents according to equivalence \(\operatorname{mod} k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500983)