The descent set and connectivity set of a permutation
From MaRDI portal
Recommendations
Cited in
(16)- A quasisymmetric function for matroids
- Block decomposition of permutations and Schur-positivity
- Block numbers of permutations and Schur-positivity
- Block number, descents and Schur positivity of fully commutative elements in \(B_n\)
- Statistics of partial permutations via Catalan matrices
- The range of repetition in reduced decompositions
- Regenerative random permutations of integers
- Combinatorics on permutation tableaux of type A and type B
- Posets related to the connectivity set of Coxeter groups.
- On adding a list of numbers (and other one-dependent determinantal processes)
- Cyclic Inclusion-Exclusion
- Forced perimeter in Elnitksy polygons
- Quasisymmetric Schur functions
- Descent sets of cyclic permutations
- On a duality in Coxeter groups.
- A matroid-friendly basis for the quasisymmetric functions
This page was built for publication: The descent set and connectivity set of a permutation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395408)