Algebraic and combinatorial aspects of sandpile monoids on directed graphs

DOI10.1016/j.jcta.2012.08.001zbMath1253.05079arXiv1105.2357OpenAlexW2090125839MaRDI QIDQ1758516

Ken W. Smith, Martin E. Malandro, Luis David García-Puente, Scott Thomas Chapman, Rebecca E. Garcia

Publication date: 9 November 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.2357

zbMATH Keywords

distance-regular graphdirected graphsandpile groupmaximal subgroupsandpile monoid

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)

Related Items

Abelian networks. III: The critical group, Connections between abelian sandpile models and the \(K\)-theory of weighted Leavitt path algebras, Chip firing on Dynkin diagrams and McKay quivers