Computer Science/Discrete Mathematics Seminar II

Extremal Erodos-Szekeres Permutations and Square Young Tableaux

An Extremal Erdos-Szekeres permutation is a permutation of the numbers 1,2,...,N^2 that has no monotone subsequence of length N+1 (and is therefore extremal with respect to the Erdos-Szekeres theorem). If an EES permutation is drawn uniformly at random, the plot of its values clusters inside a limiting shape. I will relate this to the limiting shape of the uniformly random square NxN Young tableau, found recently by me and Boris Pittel.

Date & Time

May 03, 2005 | 10:30am – 12:30pm

Location

S-101

Speakers

Dan Romik

Affiliation

MSRI, Berkeley