The Abelian sandpile model on Ferrers graphs — a classification of recurrent configurations

Dukes, Mark and Selig, Thomas and Smith, Jason P. and Steingrímsson, Einar (2019) The Abelian sandpile model on Ferrers graphs — a classification of recurrent configurations. European Journal of Combinatorics, 81. pp. 221-241. ISSN 0195-6698

[img] Text (Dukes-etal-EJC-2019-The-Abelian-sandpile-model-on-Ferrers-graphs)
Dukes_etal_EJC_2019_The_Abelian_sandpile_model_on_Ferrers_graphs.pdf
Accepted Author Manuscript
Restricted to Repository staff only until 17 June 2020.
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo

Download (246kB) | Request a copy from the Strathclyde author

    Abstract

    We classify all recurrent configurations of the Abelian sandpile model (ASM) on Ferrers graphs. The classification is in terms of decorations of EW-tableaux, which undecorated are in bijection with the minimal recurrent configurations. We introduce decorated permutations, extending to decorated EW-tableaux a bijection between such tableaux and permutations, giving a direct bijection between the decorated permutations and all recurrent configurations of the ASM. We also describe a bijection between the decorated permutations and the intransitive trees of Postnikov, the breadth-first search of which corresponds to a canonical toppling of the corresponding configurations.