Kostka Numbers and Longest Increasing Subsequences

MaRDI QIDQ6321759zbMATH OpenFDO

Authors Arjun Krishnan, Scott Neville

Publication date 8 July 2019

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19)

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.

This page was built for publication: Kostka Numbers and Longest Increasing Subsequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6321759)