论文标题
分类网络，楼梯年轻的tableaux和最后一段通道
Sorting networks, staircase Young tableaux and last passage percolation
论文作者
论文摘要
我们提出了有关三个随机过程的新组合和概率身份：$ n $颗粒上的定向交换过程，角落增长过程和最后一个段落渗透模型。我们证明了概率的身份之一，将最后一段渗透时间的随机向量与二元相关，使用了Robinson-Schensted-Knuth和Burge对应关系之间的双重性。在定向交换过程中，将这两个向量与“最后交换时间”向量相关的第二个概率身份是猜想的。在首先将其作为纯粹的组合身份重新定义后，我们为$ n \ le 6 $提供了计算机辅助证明，并讨论了它与Edelman-Greene通信的关系。
We present new combinatorial and probabilistic identities relating three random processes: the oriented swap process on $n$ particles, the corner growth process, and the last passage percolation model. We prove one of the probabilistic identities, relating a random vector of last passage percolation times to its dual, using the duality between the Robinson-Schensted-Knuth and Burge correspondences. A second probabilistic identity, relating those two vectors to a vector of "last swap times" in the oriented swap process, is conjectural. We give a computer-assisted proof of this identity for $n\le 6$ after first reformulating it as a purely combinatorial identity, and discuss its relation to the Edelman-Greene correspondence.
