论文标题
有限记录筹码游戏
Finite record sets of chip-firing games
论文作者
论文摘要
有限的图表，分配了非阴性整数到顶点的图形提供了芯片引起芯片的游戏。筹码游戏确定了称为法律游戏记录集的语言（单词集）。 Björner，Lovász和Shor发现了几个通过记录集满足的属性。在本文中，我们将找到记录集的另外两个属性。假设记录集是有限的，并且游戏仅触发两个顶点，这些属性表征了图形的记录集。
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örner, Lovász 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.
