On Ulam's Problem

Research Horizons Seminar
Wednesday, December 8, 2010 - 12:00
1 hour (actually 50 minutes)
Skiles 171
School of Mathematics - Georgia Institute of Technology

Hosts: Yao Li and Ricardo Restrepo

Ulam's problem has to do with finding asymptotics, as $n \to +\infy$, for the length of the longest increasing subsequence of a random permutation of $\{1, .., n\}. I'll survey its history, its solutions and various extensions emphasizing progresses made at GaTech.