Finite record sets of chip-firing games

DOI10.2140/IIG.2023.20.55MaRDI QIDQ6060071zbMATH OpenFDO

Authors Kentaro Akasaka, Suguru Ishibashi, Masahiko Yoshinaga

Publication date 2 November 2023

Published in Innovations in Incidence Geometry (Search for Journal in Brave)

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

zbMATH Keywords

chip-firing gamelanguages

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Abstract: A finite graph with an assignment of non-negative integers to vertices gives chip-firing games. Chip-firing games determine languages (sets of words) called the record sets of legal games. Bj"orner, Lov'asz and Shor found several properties that are satisfied by record sets. In this paper, we will find two more properties of record sets. Under the assumption that the record set is finite and the game fires only two vertices, these properties characterize the record sets of graphs.

Recommendations

• Properties of chip-firing games on complete graphs
• Chip-firing games on graphs
• Chip-firing games on directed graphs
• No polynomial bound for the period of the parallel chip firing game on graphs
• Parallel chip firing games on graphs

Cites work

• Chip-firing games on graphs
• The mathematics of chip-firing

Cited in

(2)

• On lengths of burn-off chip-firing games
• Properties of chip-firing games on complete graphs

This page was built for publication: Finite record sets of chip-firing games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6060071)