Block numbers of permutations and Schur-positivity

Research output: Contribution to journalConference articlepeer-review

Abstract

The block number of a permutation is the maximal number of components in its expression as a direct sum. We show that the distribution of the set of left-toright-maxima over 321-avoiding permutations with a given block number k is equal
to the distribution of this set over 321-avoiding permutations with the last descent of the inverse permutation at position n − k. This result is analogous to the FoataSchützenberger equi-distribution theorem, and implies Schur-positivity of the quasisymmetric generating function of descent set over 321-avoiding permutations with a prescribed block number
Original languageAmerican English
Article number64
Number of pages12
JournalSeminaire Lotharingien de Combinatoire
Volume78B
StatePublished - 2017

Bibliographical note

Proceedings of the 29th Conference on Formal Power
Article #64, 12 pp. Series and Algebraic Combinatorics (London)

Keywords

  • Schur positivity
  • permutation statistics
  • Pattern avoidance
  • quasi-symmetric function

Fingerprint

Dive into the research topics of 'Block numbers of permutations and Schur-positivity'. Together they form a unique fingerprint.

Cite this