Block decomposition of permutations and Schur-positivity
From MaRDI portal
Publication:1668673
Abstract: The block number of a permutation is the maximal number of components in its expression as a direct sum. We show that, for -avoiding permutations, the set of left-to-right maxima has the same distribution when the block number is assumed to be as when the last descent of the inverse is assumed to be at position . This result is analogous to the Foata-Sch"utzenberger equi-distribution theorem, and implies that the quasi-symmetric generating function of descent set over -avoiding permutations with a prescribed number of blocks is Schur-positive.
Recommendations
- Block numbers of permutations and Schur-positivity
- Schur-positive sets of permutations via products and grid classes
- Revisiting pattern avoidance and quasisymmetric functions
- Block number, descents and Schur positivity of fully commutative elements in \(B_n\)
- Schur-positivity via products of grid classes
Cites work
- scientific article; zbMATH DE number 1601795 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 1503622 (Why is no real title available?)
- scientific article; zbMATH DE number 2107707 (Why is no real title available?)
- scientific article; zbMATH DE number 3895079 (Why is no real title available?)
- An involution on Dyck paths that preserves the rise composition and interchanges the number of returns and the position of the first double fall
- Catalan Numbers
- Character formulas and descents for the hyperoctahedral group
- Combinatorial interpretations of convolutions of the Catalan numbers
- Counting permutations with given cycle structure and descent set
- Equidistribution and sign-balance on 321-avoiding permutations
- Ideals of quasi-symmetric functions and super-covariant polynomials for \(\mathcal S_n\)
- Major Index and Inversion Number of Permutations
- Matrices, characters and descents
- On the Netto Inversion Number of a Sequence
- Refined sign-balance on 321-avoiding permutations
- Schur-positive sets of permutations via products and grid classes
- Simple permutations and pattern restricted permutations
- Subclasses of the separable permutations
- The descent set and connectivity set of a permutation
- The location of the first ascent in a 123-avoiding permutation
- The representation theory of the symmetric groups
Cited in
(12)- Block algorithms for reordering standard and generalized Schur forms
- Block numbers of permutations and Schur-positivity
- A combinatorial bijection on di-sk trees
- Block number, descents and Schur positivity of fully commutative elements in \(B_n\)
- Plethysm and the algebra of uniform block permutations
- Schur-concavity for avoidance of increasing subsequences in block-ascending permutations
- A symmetric function resolution of the number of permutations with respect to block-stable elements
- scientific article; zbMATH DE number 474585 (Why is no real title available?)
- Refined Wilf-equivalences by Comtet statistics
- On rotated Schur-positive sets
- Schur-positive sets of permutations via products and grid classes
- A decomposition of \(\text{Fl}(n)^d\) indexed by permutation arrays
This page was built for publication: Block decomposition of permutations and Schur-positivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1668673)