Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.


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

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


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