一、题目

RSK Algorithm with Applications to Random Combinatorial Optimizations

二、主讲人

苏中根 教授

三、摘要

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.

四、主讲人简介

苏中根，浙江大学教授，博士生导师。1995年获复旦大学博士学位，主要从事概率极限理论及其应用研究，在《Probability Theory and Related Fields》《Stochastic Processes with their Applications》《Journal of Mathematical Physics》《Proceedings of Royal Society, A》《Science China: Mathematics》等国际主流专业杂志上发表论文近50篇，出版教材和专著4本。现已主持完成多项国家自然科学基金面上项目、 教育部博士点专项基金(导师类)项目和浙江省自然科学基金杰出青年团队项目等。与林正炎、陆传荣先生合作编著的《概率极限理论基础》2002年荣获全国普通高校优秀教材一等奖。

五、邀请人

王汉超 副教授

六、时间

10月29日（周四）15:30-16:30

七、地点

腾讯会议 ID：130 158 527

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

八、主办方

山东大学数学学院