학술
Labeled Chip-Firing on Ordered Directed Graphs
arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.Abstract
We study labeled chip-firing on rooted directed graphs where for each vertex $v$, the children of $v$ are linearly ordered.
When a vertex fires, the selected chips are sent to its children in increasing order.
We show that homomorphisms preserving these child choices transport legal firing sequences.
We then consider the directed lattice $\mathbb Z_{\geq0}^2$ and ask which chips can reach a given vertex.
We give a recurrence for the smallest reachable label when sufficiently many chips are present and show that consecutive pairing attains this minimum.
Finally, we determine the largest reachable label by symmetry and prove that the reachable labels form an interval when the number of initial chips is sufficiently large.
관련 뉴스
'research' 카테고리 뉴스
Correction: Pupillary dynamics during hands-off L2 driving and transitions of control under high cognitive load
PLOS ONE
Correction: Ornamental motifs and visual concerns: Exploring aesthetic pleasure and conservation intention in architectural heritage renovation
PLOS ONE
Correction: Who is disrupting whom? Examining the nighttime activity patterns of humans and their dogs
PLOS ONE