Permutation Graphs and the Abelian Sandpile Model, Tiered Trees and Non-Ambiguous Binary Trees

Mark Dukes, Thomas Selig, Jason P. Smith, Einar Steingrimsson

Research output: Contribution to journalArticle

1 Downloads (Pure)

Abstract

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the tiered trees introduced by Dugan et al. [10]. This bijection allows certain parameters of the recurrent configurations to be read on the corresponding tree. In particular, we show that the level of a recurrent configuration can be interpreted as the external activity of the corresponding tree, so that the bijection exhibited provides a new proof of a famous result linking the level polynomial of the ASM to the ubiquitous Tutte polynomial. We show that the set of minimal recurrent configurations is in bijection with the set of complete non-ambiguous binary trees introduced by Aval et al. [2], and introduce a multi-rooted generalization of these that we show to correspond to all recurrent configurations. In the case of permutations with a single descent, we recover some results from the case of Ferrers graphs presented in [11], while we also recover results of Perkinson et al. [16] in the case of threshold graphs.

Original languageEnglish
Article numberP3.29
JournalElectronic Journal of Combinatorics
Volume26
Issue number3
Publication statusPublished - 16 Aug 2019

Fingerprint

Permutation Graphs
Sandpile Model
Binary trees
Binary Tree
Bijection
Configuration
Polynomials
Permutation
Graph in graph theory
Threshold Graph
Tutte Polynomial
Descent
Linking
Inversion
Polynomial

Keywords

  • math.CO

Cite this

Permutation Graphs and the Abelian Sandpile Model, Tiered Trees and Non-Ambiguous Binary Trees. / Dukes, Mark; Selig, Thomas; Smith, Jason P.; Steingrimsson, Einar.

In: Electronic Journal of Combinatorics, Vol. 26, No. 3, P3.29, 16.08.2019.

Research output: Contribution to journalArticle

@article{d874c7dfce6848e7b17e1f27af3da8ce,
title = "Permutation Graphs and the Abelian Sandpile Model, Tiered Trees and Non-Ambiguous Binary Trees",
abstract = "A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the tiered trees introduced by Dugan et al. [10]. This bijection allows certain parameters of the recurrent configurations to be read on the corresponding tree. In particular, we show that the level of a recurrent configuration can be interpreted as the external activity of the corresponding tree, so that the bijection exhibited provides a new proof of a famous result linking the level polynomial of the ASM to the ubiquitous Tutte polynomial. We show that the set of minimal recurrent configurations is in bijection with the set of complete non-ambiguous binary trees introduced by Aval et al. [2], and introduce a multi-rooted generalization of these that we show to correspond to all recurrent configurations. In the case of permutations with a single descent, we recover some results from the case of Ferrers graphs presented in [11], while we also recover results of Perkinson et al. [16] in the case of threshold graphs.",
keywords = "math.CO",
author = "Mark Dukes and Thomas Selig and Smith, {Jason P.} and Einar Steingrimsson",
note = "Dukes, Selig and Steingr´ımsson were supported by grant EP/M015874/1 from The Engineering and Physical Sciences Research Council. Smith was supported by grant EP/M027147/1 from The Engineering and Physical Sciences Research Council.",
year = "2019",
month = "8",
day = "16",
language = "English",
volume = "26",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "3",

}

TY - JOUR

T1 - Permutation Graphs and the Abelian Sandpile Model, Tiered Trees and Non-Ambiguous Binary Trees

AU - Dukes, Mark

AU - Selig, Thomas

AU - Smith, Jason P.

AU - Steingrimsson, Einar

N1 - Dukes, Selig and Steingr´ımsson were supported by grant EP/M015874/1 from The Engineering and Physical Sciences Research Council. Smith was supported by grant EP/M027147/1 from The Engineering and Physical Sciences Research Council.

PY - 2019/8/16

Y1 - 2019/8/16

N2 - A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the tiered trees introduced by Dugan et al. [10]. This bijection allows certain parameters of the recurrent configurations to be read on the corresponding tree. In particular, we show that the level of a recurrent configuration can be interpreted as the external activity of the corresponding tree, so that the bijection exhibited provides a new proof of a famous result linking the level polynomial of the ASM to the ubiquitous Tutte polynomial. We show that the set of minimal recurrent configurations is in bijection with the set of complete non-ambiguous binary trees introduced by Aval et al. [2], and introduce a multi-rooted generalization of these that we show to correspond to all recurrent configurations. In the case of permutations with a single descent, we recover some results from the case of Ferrers graphs presented in [11], while we also recover results of Perkinson et al. [16] in the case of threshold graphs.

AB - A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the tiered trees introduced by Dugan et al. [10]. This bijection allows certain parameters of the recurrent configurations to be read on the corresponding tree. In particular, we show that the level of a recurrent configuration can be interpreted as the external activity of the corresponding tree, so that the bijection exhibited provides a new proof of a famous result linking the level polynomial of the ASM to the ubiquitous Tutte polynomial. We show that the set of minimal recurrent configurations is in bijection with the set of complete non-ambiguous binary trees introduced by Aval et al. [2], and introduce a multi-rooted generalization of these that we show to correspond to all recurrent configurations. In the case of permutations with a single descent, we recover some results from the case of Ferrers graphs presented in [11], while we also recover results of Perkinson et al. [16] in the case of threshold graphs.

KW - math.CO

M3 - Article

VL - 26

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 3

M1 - P3.29

ER -