Completely symmetric configurations for -games on grid graphs
From MaRDI portal
Publication:976843
Abstract: The paper deals with sigma-games on grid graphs (in dimension 2 and more) and conditions under which any completely symmetric configuration of lit vertices can be reached -- in particular the completely lit configuration -- when starting with the all-unlit configuration. The answer is complete in dimension 2. In dimension greater than or equal to 3, the answer is complete for the sigma^+ -game, and for the sigma^- -game if at least one of the sizes is even. The case sigma^-, dimension greater than or equal to 3 and all sizes odd remains open.
Recommendations
- Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs
- Note on the lamp lighting problem
- Two-lit trees for lit-only \(\sigma \)-game
- Minimum light numbers in the \(\sigma \)-game and lit-only \(\sigma \)-game on unicyclic and grid graphs
- Lit-only sigma-game on nondegenerate graphs
Cites work
- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
- Linear cellular automata and the garden-of-eden
- Parity dominating sets in grid graphs
- \(\sigma\)-Automata and Chebyshev-polynomials
- \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
Cited in
(3)
This page was built for publication: Completely symmetric configurations for \(\sigma \)-games on grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976843)
