Sorting via chip-firing

zbMath1369.05148arXiv1612.06816MaRDI QIDQ5920071

James Propp, Thomas McConville, Sam Hopkins

Publication date: 8 September 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

File on IPFS

zbMATH Keywords

confluenceabelian sandpile modelchip-firing

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (10)

Toppleable permutations, excedances and acyclic orientations ⋮ Root system chip-firing ⋮ Toppling on permutations with an extra chip ⋮ An Ising model having permutation spin motivated by a permutation complexity measure ⋮ Flow-firing processes ⋮ A positive formula for the Ehrhart-like polynomials from root system chip-firing ⋮ Labeled chip-firing on binary trees with \(2^n -1\) chips ⋮ Ending states of a special variant of the chip-firing algorithm ⋮ Confluence in labeled chip-firing ⋮ Root system chip-firing. I: Interval-firing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abelian networks. III: The critical group
• Chip firing on Dynkin diagrams and McKay quivers
• Chip-firing games on graphs
• Abelian networks. II: Halting on all inputs
• Balancing vectors in the max norm
• Why does the probabilistic abacus work?
• On theories with a combinatorial definition of 'equivalence'
• Abelian Networks I. Foundations and Examples
• Groupes et algébras de Lie
• Disks, Balls, and Walls: Analysis of a Combinatorial Game
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Self-organized critical state of sandpile automaton models
• Abelian Logic Gates

This page was built for publication: Sorting via chip-firing