Toppling on permutations with an extra chip

DOI10.37236/10420zbMath1478.05002arXiv2104.13654OpenAlexW3213802013MaRDI QIDQ2665957

Arvind Ayyer, Beáta Bényi

Publication date: 22 November 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.13654

zbMATH Keywords

decomposable permutationstoppleable permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

An Ising model having permutation spin motivated by a permutation complexity measure

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorics of \(\mathcal H\)-primes in quantum matrices
• Poly-Bernoulli numbers
• Matrices uniquely determined by their lonesums
• Flow-firing processes
• Results in labeled chip-firing
• Asymptotic enumeration of lonesum matrices
• Asymptotics of the extremal excedance set statistic
• A positive formula for the Ehrhart-like polynomials from root system chip-firing
• Root system chip-firing. I: Interval-firing
• Generating indecomposable permutations
• Bruhat intervals as rooks on skew Ferrers boards
• Root system chip-firing
• Combinatorics of poly-Bernoulli numbers
• Multiple zeta values, poly-Bernoulli numbers, and related zeta functions
• Combinatorial properties of poly-Bernoulli relatives
• Sorting via chip-firing

This page was built for publication: Toppling on permutations with an extra chip