Picture of neon light reading 'Open'

Discover open research at Strathprints as part of International Open Access Week!

23-29 October 2017 is International Open Access Week. The Strathprints institutional repository is a digital archive of Open Access research outputs, all produced by University of Strathclyde researchers.

Explore recent world leading Open Access research content this Open Access Week from across Strathclyde's many research active faculties: Engineering, Science, Humanities, Arts & Social Sciences and Strathclyde Business School.

Explore all Strathclyde Open Access research outputs...

Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a Cyclic Lemma

Aval, Jean-Christophe and D'Adderio, Michele and Dukes, Mark and Le Borgne, Yvan (2016) Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a Cyclic Lemma. Advances in Applied Mathematics, 73. pp. 59-98. ISSN 0196-8858

[img]
Preview
Text (Aval-etal-AAM-2015-Two-operators-on-sandpile-configurations-the-sandpile-model-on-the-complete-bipartite-graph)
Aval_etal_AAM_2015_Two_operators_on_sandpile_configurations_the_sandpile_model_on_the_complete_bipartite_graph.pdf - Accepted Author Manuscript
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo

Download (485kB) | Preview

Abstract

We introduce two operators on stable configurations of the sandpile model that provide an algorithmic bijection between recurrent and parking congurations. This bijection preserves their equivalence classes with respect to the sandpile group. The study of these operators in the special case of the complete bipartite graph K m;n naturally leads to a generalization of the well known Cyclic Lemma of Dvoretsky and Motzkin, via pairs of periodic bi-in nite paths in the plane having slightly different slopes. We achieve our results by interpreting the action of these operators as an action on a point in the grid Z2 which is pointed to by one of these pairs of paths. Our Cyclic lemma allows us to enumerate several classes of polyominoes, and therefore builds on the work of Irving and Rattan (2009), Chapman et al. (2009), and Bonin et al. (2003).