Finite record sets of chip-firing games
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:PU2CAXRLrecord.jsonopen to challenge →
classification
math.CO
keywords
recordsetsgameschip-firingfinitepropertiesverticesassignment
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.