The cycle descent statistic on permutations
From MaRDI portal
Abstract: In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect matchings.
Recommendations
Cites work
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- A class of \(q\)-symmetric functions arising from plethysm
- Complexes oft-Colorable Graphs
- Derangement polynomials and excedances of type \(B\)
- Excedance numbers for the permutations of type \(B\)
- Klazar trees and perfect matchings
- Matching theory
- Ordered partitions and drawings of rooted plane trees
- Oscillating rim hook tableaux and colored matchings
- Statistics on the multi-colored permutation groups
- The On-Line Encyclopedia of Integer Sequences
- Théorie géométrique des polynômes eulériens
- Twelve countings with rooted plane trees
- Two involutions for signed excedance numbers
- \(q\)-Eulerian polynomials arising from Coxeter groups
Cited in
(12)- Descents of derangements and circular words
- Counting permutations with given cycle structure and descent set
- Frame patterns in \(n\)-cycles
- Cycle-up-down permutations
- The descent set and connectivity set of a permutation
- Cyclic descents, matchings and Schur-positivity
- On Schur-positivity of the descent set on matchings
- Statistics-preserving bijections between classical and cyclic permutations
- The peak and descent statistics over ballot permutations
- Major and descent statistics for the even-signed permutation group
- Descent sets of cyclic permutations
- Signed permutation statistics and cycle type
This page was built for publication: The cycle descent statistic on permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727196)