Classifying descents according to equivalence mod k
Summary: In an earlier paper the authors refine the well-known permutation statistic ``descent by fixing parity of (exactly) one of the descent's numbers. In the current paper, we generalize the results of that earlier paper by studying descents according to whether the first or the second element in a descent pair is divisible by \(k\) for some \(k\geq 2\). 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.
- 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
- 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
- Counting descents, rises, and levels, with prescribed first element, in words
- The homogenized linial arrangement and Genocchi numbers
- The combinatorics of Jeff Remmel
- Enumeration of Dumont permutations avoiding certain four-letter patterns
- Counting descent pairs with prescribed tops and bottoms
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)
