- Series
- Research Horizons Seminar
- Time
- Wednesday, December 8, 2010 - 12:00pm for 1 hour (actually 50 minutes)
- Location
- Skiles 171
- Speaker
- Christian Houdre – School of Mathematics - Georgia Institute of Technology – http://people.math.gatech.edu/~houdre/
- Organizer
- Ricardo Restrepo
Please Note: 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.