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

用一个额外的筹码推翻排列

Toppling on permutations with an extra chip

Arvind Ayyer, Beáta Bényi

摘要:

第一作者与D。Hathcock和P. Tetali(arXiv:2010.11236),其中额外的芯片被添加在中间。我们扩展到所有可能的位置$p$以及值$r$的额外的芯片,并给出了一个完整的特性的排列推翻的身份。此外,我们分类所有的排列,这是倾倒过程的结果,在这个一般性,我们称之为结果排列。结果置换证明是某些可分解置换。倾倒到一个给定的结果置换的配置的数量被证明是纯粹依赖于从左到右的最大值(或记录)的置换的数量向左的$n-p$和从右到左的最小值的$n-p$的权利。倾倒到一个给定的结果置换(单位或其他)的置换的数量被证明是一个B型多伯努利数的二项式变换。

英文摘要:

The study of toppling on permutations with an extra labeled chip was initiated by the first author with D. Hathcock and P. Tetali (arXiv:2010.11236), where the extra chip was added in the middle. We extend this to all possible locations $p$ as well as values $r$ of the extra chip and give a complete characterization of permutations which topple to the identity. Further, we classify all permutations which are outcomes of the toppling process in this generality, which we call resultant permutations. Resultant permutations turn out to be certain decomposable permutations. The number of configurations toppling to a given resultant permutation is shown to depend purely on the number of left-to-right maxima (or records) of the permutation to the left of $n-p$ and the number of right-to-left minima to the right of $n-p$. The number of permutations toppling to a given resultant permutation (identity or otherwise) is shown to be the binomial transform of a poly-Bernoulli number of type B.

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

↑