Block decomposition of permutations and Schur-positivity
Combinatorics
2017-09-08 v2
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.
Keywords
Cite
@article{arxiv.1611.06979,
title = {Block decomposition of permutations and Schur-positivity},
author = {Ron M. Adin and Eli Bagno and Yuval Roichman},
journal= {arXiv preprint arXiv:1611.06979},
year = {2017}
}
Comments
22 pages, 1 figure