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

Mark Dukes, Thomas Selig, Jason P. Smith, Einar Steingrímsson

Research output: Contribution to journalArticle

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.

LanguageEnglish
Pages221-241
Number of pages21
JournalEuropean Journal of Combinatorics
Volume81
Early online date17 Jun 2019
DOIs
Publication statusE-pub ahead of print - 17 Jun 2019

Fingerprint

Sandpile Model
Bijection
Tableaux
Permutation
Configuration
Graph in graph theory
Intransitive
Breadth-first Search
Classify

Keywords

  • Abelian sandpile model
  • EW-tableaux
  • Ferrers graph

Cite this

@article{8383871f049d46b2b48c036a588cd47f,
title = "The Abelian sandpile model on Ferrers graphs — a classification of recurrent configurations",
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.",
keywords = "Abelian sandpile model, EW-tableaux, Ferrers graph",
author = "Mark Dukes and Thomas Selig and Smith, {Jason P.} and Einar Steingr{\'i}msson",
year = "2019",
month = "6",
day = "17",
doi = "10.1016/j.ejc.2019.05.008",
language = "English",
volume = "81",
pages = "221--241",
journal = "European Journal of Combinatorics",
issn = "0195-6698",

}

The Abelian sandpile model on Ferrers graphs — a classification of recurrent configurations. / Dukes, Mark; Selig, Thomas; Smith, Jason P.; Steingrímsson, Einar.

In: European Journal of Combinatorics, Vol. 81, 31.10.2019, p. 221-241.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Dukes, Mark

AU - Selig, Thomas

AU - Smith, Jason P.

AU - Steingrímsson, Einar

PY - 2019/6/17

Y1 - 2019/6/17

N2 - 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.

AB - 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.

KW - Abelian sandpile model

KW - EW-tableaux

KW - Ferrers graph

UR - http://www.scopus.com/inward/record.url?scp=85067260076&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2019.05.008

DO - 10.1016/j.ejc.2019.05.008

M3 - Article

VL - 81

SP - 221

EP - 241

JO - European Journal of Combinatorics

T2 - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

ER -