Pages that link to "Item:Q1331936"
From MaRDI portal
The following pages link to Reachability is decidable in the numbers game (Q1331936):
Displaying 9 items.
- On dominance and minuscule Weyl group elements. (Q633275) (← links)
- Looping of the numbers game and the alcoved hypercube (Q662037) (← links)
- Eriksson's numbers game and finite Coxeter groups (Q942147) (← links)
- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game? (Q1024268) (← links)
- Relaxation procedures on graphs (Q1026124) (← links)
- Universality of the chip-firing game (Q1392019) (← links)
- Strong convergence and the polygon property of 1-player games (Q1917518) (← links)
- When Is Reachability Intrinsically Decidable? (Q3533013) (← links)
- NORMALITY AND QUADRATICITY FOR SPECIAL AMPLE LINE BUNDLES ON TORIC VARIETIES ARISING FROM ROOT SYSTEMS (Q5397381) (← links)