Date: Thursday, February 07, 2013
Location: Nesbitt Room (4:00 PM to 5:00 PM)
Title: Longest Monotone Subsequences
Abstract: A so-called ``well known theorem" states that in any permutation of {1, 2,..., n^2+1}, there exists a monotone subsequence of length at least n+1, either increasing or decreasing. In 1961 Stan Ulam raised the problem of determining the distribution of the longest increasing subsequence of a random permutation. In 1972 Hammersley wrote a fascinating essay on this problem: "A few seedlings of research." We discuss this problem and research it led to in probability and statistical physics.
Speaker: Jinho Baik
Institution: Univ. of Michigan
Event Organizer:
|
