Kostka Numbers and Longest Increasing Subsequences

Abstract

A classical bijection relates certain Kostka numbers, the Catalan numbers, and permutations of length $n$ with longest increasing subsequence (LIS) of length at most $2.$ We generalize this bijection and find Kostka numbers which count the number of permutations of $n$ with LIS length at most $w,$ the number of permutations with $(1, \cdots, w)$ as a LIS, and other similar subsets of permutations.