arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1012.1819math.CO
收藏

关于RSK对应的Lipschitz常数

On the Lipschitz Constant of the RSK Correspondence

Nayantara Bhatnagar, Nathan Linial

摘要:

我们将RSK对应关系视为将Young图$λ=λ(π)$(即,$n$的分区)与每个置换$π\in S_n$相关联。现在假设$π$左乘$t$转置,那么$λ$中最多可以改变多少个单元?很自然地,我们把这个问题称为寻找RSK对应的Lipschitz常数。我们显示上界这个Lipschitz常数作为$t$的函数。对于$t=1$,我们给出了一个能精确达到这个界的置换的构造。对于较大的$t$,我们构造的排列接近匹配的上界,我们证明。

英文摘要:

We view the RSK correspondence as associating to each permutation $π\in S_n$ a Young diagram $λ=λ(π)$, i.e. a partition of $n$. Suppose now that $π$ is left-multiplied by $t$ transpositions, what is the largest number of cells in $λ$ that can change as a result? It is natural refer to this question as the search for the Lipschitz constant of the RSK correspondence. We show upper bounds on this Lipschitz constant as a function of $t$. For $t=1$, we give a construction of permutations that achieve this bound exactly. For larger $t$ we construct permutations which come close to matching the upper bound that we prove.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑