Combinatorics Reading Seminar: Longest Increasing Subsequences and Oscillating Tableaux II

Seminar | September 11 | 11:10 a.m.-12:10 p.m. | 748 Evans Hall

 Jeremy Meza, UC Berkeley

 Department of Mathematics

We will start with a quick primer on the RSK correspondence and Berele insertion. This will lead us into longest increasing subsequences of permutations and analogous statistics on oscillating tableaux. We will discuss computational methods, explicit formulas, and if time permits, asymptotics. This is meant to be an introductory talk to set ourselves up for future topics. (Part II of the talk)