Student Combinatorics Seminar

A classical bijection relates the Catalan numbers and permutations of length n with longest increasing subsequence (LIS) of length at most 2. I'll discuss the major elements of this classical bijection, as well as joint work with Arjun Krishnan, in which we generalize this bijection and find Kostka numbers which count the number of permutations of n with LIS length at most w, and similar sets of restricted permutations. Speaker(s): Scott Neville (UM)