arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.00763math.CO
收藏

树上自可达筹码配置

Self-Reachable Chip Configurations on Trees

Benjamin Lyons, McCabe Olsen

AI总结:

本文研究树上自可达筹码配置,给出其刻画、相同筹码数配置间的可达性,并推导出递归枚举公式。

摘要:

本文探讨了简单图上“自可达”筹码配置的概念,即一种筹码配置,经过(非空的)一系列顶点触发后能够重新得到自身。我们特别关注树的情形,给出了此类配置的一个刻画,并证明了树上具有相同筹码数的所有自可达配置彼此之间都是可达的。最后,我们给出了自可达配置数量的一个递归枚举公式。

英文摘要:

In this paper, we explore the notion of a \emph{self-reachable} chip configuration on a simple graph, that is a chip configuration which can be re-obtained from itself after a (nonempty) sequence of vertex firings. In particular, we focus on the case of trees and provide a characterization for such configurations, as well as show that all self-reachable configurations with the same number of chips on a tree are reachable from one another. We conclude with a recursive enumeration formula for the number of self-reachable configurations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑