Commentary on “Longest increasing subsequences: from patience sorting to the Baik–Deift–Johansson theorem” by David Aldous and Persi Diaconis
Commentary on “Longest increasing subsequences: from patience sorting to the Baik–Deift–Johansson theorem” by David Aldous and Persi Diaconis
复制标题
DOI：
10.1090/bull/1623
复制
发表时间：
2018-04
影响因子：
1.3
通讯作者：
Ivan Corwin
中科院分区：
文献类型：
--
作者：
Ivan Corwin
紧接着下面的评论，这篇以前发表的文章全文转载：大卫奥尔德斯和波斯Diaconis，“最长的增加的连续性：从耐心排序到Baik-Deift-Johansson定理”，布尔。美国数学学会。(NS)36（1999），no. 4，413-432中描述的。引用
Immediately following the commentary below, this previously published article is reprinted in its entirety: David Aldous and Persi Diaconis,“Longest increasing subsequences: from patience sorting to the Baik–Deift–Johansson theorem”, Bull. Amer. Math. Soc.(NS) 36 (1999), no. 4, 413–432. References