On the Toppling of a Sand Pile

In this paper, we provide the first study of the sand pile model SPM(0) where we assume that all the grains are numbered with a distinct integer.We obtain a lower bound on the number of terminal sand piles by establishing a bijection between a subset of these sand piles and the set of shifted Young...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics and theoretical computer science 2001-01, Vol.DMTCS Proceedings vol. AA,... (Proceedings), p.275-286
Main Authors: Novelli, Jean-Christophe, Rossin, Dominique
Format: Article
Language:English
Subjects:
[info.info-cg] computer science [cs]/computational geometry [cs.cg]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[info] computer science [cs]
[math.math-co] mathematics [math]/combinatorics [math.co]
Combinatorics
Computational Geometry
Computer Science
Discrete Mathematics
Mathematics
sand pile model
young tableaux
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we provide the first study of the sand pile model SPM(0) where we assume that all the grains are numbered with a distinct integer.We obtain a lower bound on the number of terminal sand piles by establishing a bijection between a subset of these sand piles and the set of shifted Young tableaux. We then prove that this number is at least factorial.
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.2283