arXiv Analytics

Sign in

arXiv:2104.13654 [math.CO]AbstractReferencesReviewsResources

Toppling on permutations with an extra chip

Arvind Ayyer, Beáta Bényi

Published 2021-04-28Version 1

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.

Comments: 27 pages, 1 figure, 3 tables
Categories: math.CO, math.PR
Subjects: 05A15, 05A10, 05A19
Related articles: Most relevant | Search more
arXiv:1804.08919 [math.CO] (Published 2018-04-24)
How to generalize (and not to generalize) the Chu--Vandermonde identity
arXiv:2110.14712 [math.CO] (Published 2021-10-27, updated 2022-01-20)
Complete characterization of the minimal-ABC trees
arXiv:2310.12283 [math.CO] (Published 2023-10-17)
A characterization of 4-connected graphs with no $K_{3,3}+v$-minor