Keynote Speaker:Su Zhonggen

Abstract:

The Robinson-Schensted-Knuth algorithm was invented to search for the longest increasing subsequences from a finite sequence of distinct real numbers. It is arguably recognized as one of the most useful algorithms in the field of combinatorial optimization. In this talk we will first describe such an algorithm, and then focus on its applications to random combinatorial optimization problems. In particular, we briefly review two remarkable results: Baik, Defit and Johansson (JAMS 1999) discovered the limiting distribution of the length of longest increasing subsequences of a sequence of i.i.d. uniform random variables; Johnsson (CMP 2000) established the limiting distribution of last passage percolation with i.i.d. geometric weights in the planar lattice. It turns out that a new era for the study of random growth processes has been since then open to us.

Introduction to the Speaker:

Su Zhonggen, Professor of Zhejiang University, Doctoral Supervisor. In 1995, he was granted a doctoral degree from Fudan University. He is mainly engaged in researches on the probability limit theory and its application. So far, he has published nearly 50 papers in such major international professional journals asProbability Theory and Related Fields,Stochastic Processes with their Applications,Journal of Mathematical Physics,Proceedings of Royal Society, AandScience China: Mathematics, and has published four textbooks and monographs. He has presided over and completed a number of general projects of the National Natural Science Foundation of China, projects funded by the Special Fund (Tutor) of Doctoral Program of the Ministry of Education and the Outstanding Youth Team Project of the Natural Science Foundation of Zhejiang Province. Especially, he was granted the first prize of the Excellent Teaching Materials of National Colleges and Universities for theTheoretical Basis of Probability Limitco-edited with Mr. Lin Zhengyan and Mr. Lu Chuanrong in 2002.

Inviter:

Wang Hanchao Associate Professor

Time:

15:30-16:30 on October 29 (Thursday)

Location:

Tencent Meeting ID: 130 158 527

https://meeting.tencent.com/s/OnOvwlYvu6ZZ

Sponsored by: School of Mathematics, Shandong University