Tid: 2 februari 1998 kl 1515-1700
Plats : Seminarierummet 3733, Institutionen för matematik, KTH, Lindstedts väg 25, plan 7. Karta!
Föredragshållare: Kurt Johansson, Matematik , Kungl. Tekniska Högskolan. (Publikationslista)
Titel: The longest increasing subsequence in a random permutation
Sammanfattning: Pick a permutation uniformly from and consider the length of the longest increasing subsequence in . For example, the longest increasing subsequence in is . What can we say about the distribution of as N becomes large? A classical result is that , but apart from that not much is known. I will give some background on the problem and discuss a new approach which connects the distribution of to certain Toeplitz determinants and a unitary random matrix model.
To the list of seminars