Results and conjectures on the Sandpile Identity on a lattice - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2003

Results and conjectures on the Sandpile Identity on a lattice

Abstract

In this paper we study the identity of the Abelian Sandpile Model on a rectangular lattice.This configuration can be computed with the burning algorithm, which, starting from the empty lattice, computes a sequence of configurations, the last of which is the identity.We extend this algorithm to an infinite lattice, which allows us to prove that the first steps of the algorithm on a finite lattice are the same whatever its size.Finally we introduce a new configuration, which shares the intriguing properties of the identity, but is easier to study.
Fichier principal
Vignette du fichier
dmAB0108.pdf (439.04 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01183316 , version 1 (12-08-2015)

Identifiers

Cite

Arnaud Dartois, Clémence Magnien. Results and conjectures on the Sandpile Identity on a lattice. Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.89-102, ⟨10.46298/dmtcs.2308⟩. ⟨hal-01183316⟩
277 View
651 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More