Reachability is decidable in the numbers game

DOI10.1016/0304-3975(94)90182-1zbMath0820.90149OpenAlexW2003941712MaRDI QIDQ1331936

Kimmo Eriksson

Publication date: 29 August 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90182-1

zbMATH Keywords

numbers gameMozes

Mathematics Subject Classification ID

Combinatorial games (91A46)

Related Items (8)

Strong convergence and the polygon property of 1-player games ⋮ Universality of the chip-firing game ⋮ On dominance and minuscule Weyl group elements. ⋮ Looping of the numbers game and the alcoved hypercube ⋮ NORMALITY AND QUADRATICITY FOR SPECIAL AMPLE LINE BUNDLES ON TORIC VARIETIES ARISING FROM ROOT SYSTEMS ⋮ Eriksson's numbers game and finite Coxeter groups ⋮ Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game? ⋮ Relaxation procedures on graphs

Cites Work

• Chip-firing games on directed graphs
• Convergence of Mozes's game of numbers
• Reflection processes on graphs and Weyl groups
• Strong convergence and a game of numbers
• Unnamed Item
• Unnamed Item

This page was built for publication: Reachability is decidable in the numbers game