Block decomposition of permutations and Schur-positivity

DOI10.1007/S10801-017-0788-9zbMATH Open1476.05003arXiv1611.06979OpenAlexW2963455400MaRDI QIDQ1668673FDOQ1668673

Authors: Ron Adin, Eli Bagno, Yuval Roichman 

Publication date: 29 August 2018

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: The block number of a permutation is the maximal number of components in its expression as a direct sum. We show that, for $321$-avoiding permutations, the set of left-to-right maxima has the same distribution when the block number is assumed to be $k$ as when the last descent of the inverse is assumed to be at position $n-k$. This result is analogous to the Foata-Sch"utzenberger equi-distribution theorem, and implies that the quasi-symmetric generating function of descent set over $321$-avoiding permutations with a prescribed number of blocks is Schur-positive.

Full work available at URL: https://arxiv.org/abs/1611.06979

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

zbMATH Keywords

equidistributionSchur-positivityblock number

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The representation theory of the symmetric groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Counting permutations with given cycle structure and descent set
• Title not available (Why is that?)
• Major Index and Inversion Number of Permutations
• Character formulas and descents for the hyperoctahedral group
• Matrices, characters and descents
• On the Netto Inversion Number of a Sequence
• Combinatorial interpretations of convolutions of the Catalan numbers
• Catalan Numbers
• Title not available (Why is that?)
• Simple permutations and pattern restricted permutations
• Ideals of quasi-symmetric functions and super-covariant polynomials for \(\mathcal S_n\)
• Equidistribution and sign-balance on 321-avoiding permutations
• Refined sign-balance on 321-avoiding permutations
• Schur-positive sets of permutations via products and grid classes
• The descent set and connectivity set of a permutation
• Subclasses of the separable permutations
• An involution on Dyck paths that preserves the rise composition and interchanges the number of returns and the position of the first double fall
• The location of the first ascent in a 123-avoiding permutation

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
• Title not available (Why is that?)
• 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

Uses Software

• OEIS

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)