arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.08390math.COmath.PR
收藏

大型Young图的排序概率

Sorting probability for large Young diagrams

Swee Hong Chan, Igor Pak, Greta Panova

摘要:

对于有限偏序集$P=(X,\prec)$,令$\mathcal{L}_P$表示$P$的线性扩张集。排序概率$δ(P)$被定义为\[δ(P) \, := \, \min_{x,y\in X} \, \bigl| \mathbf{P} \, [L(x)\leq L(y) ] \ - \ \mathbf{P} \, [L(y)\leq L(x) ] \bigr|\,, \],其中$L \in \mathcal{L}_P$是$P$的均匀线性扩展。我们给出了与大Young图和大斜Young图相关的偏序集的排序概率的渐近上界,其中行数有界。

英文摘要:

For a finite poset $P=(X,\prec)$, let $\mathcal{L}_P$ denote the set of linear extensions of $P$. The sorting probability $δ(P)$ is defined as \[δ(P) \, := \, \min_{x,y\in X} \, \bigl| \mathbf{P} \, [L(x)\leq L(y) ] \ - \ \mathbf{P} \, [L(y)\leq L(x) ] \bigr|\,, \] where $L \in \mathcal{L}_P$ is a uniform linear extension of $P$. We give asymptotic upper bounds on sorting probabilities for posets associated with large Young diagrams and large skew Young diagrams, with bounded number of rows.

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

↑