Schur-Concavity for Avoidance of Increasing Subsequences in Block-Ascending Permutations

TL;DR

This paper studies permutations avoiding increasing subsequences of length k+2 with specific descent set restrictions, demonstrating symmetry and Schur-concavity properties of their counts, generalizing previous observations.

Contribution

It establishes that the number of such permutations is symmetric and Schur-concave in the parameters, providing new combinatorial bijections and generalizing prior results.

Findings

Number of permutations is symmetric in parameters

Permutation counts are Schur-concave functions

Generalizes previous combinatorial equivalences

Abstract

For integers $a_1, \dots, a_n \ge 0$ and $k \ge 1$, let $\mathcal L_{k+2}(a_1, \dots, a_n)$ denote the set of permutations of $\{1, \dots, a_1+\dots+a_n\}$ whose descent set is contained in $\{a_1, a_1+a_2, \dots, a_1+\dots+a_{n-1}\}$, and which avoids the pattern $12\dots(k+2)$. We exhibit some bijections between such sets, most notably showing that $\# \mathcal L_{k+2} (a_1, \dots, a_n)$ is symmetric in the $a_i$ and is in fact Schur-concave. This generalizes a set of equivalences observed by Mei and Wang.