Note on the lamp lighting problem
From MaRDI portal
Publication:5956771
DOI10.1006/aama.2001.0739zbMath0995.05096arXivmath/0411201OpenAlexW1981580454MaRDI QIDQ5956771
Jonas Sjöstrand, Henrik Eriksson, Kimmo Eriksson
Publication date: 16 June 2002
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0411201
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Cellular automata (computational aspects) (68Q80) Combinatorial aspects of tessellation and tiling problems (05B45) Matrices of integers (15B36) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Matrices, determinants in number theory (11C20)
Related Items (16)
“Lights Out” and Variants ⋮ Lit-only \(\sigma \)-game on pseudo-trees ⋮ Lights Out On A Random Graph ⋮ On the complexity of dominating set problems related to the minimum all-ones problem ⋮ Generalized switch-setting problems ⋮ The general \(\sigma \) all-ones problem for trees ⋮ The edge-flipping group of a graph ⋮ Construction of \(\sigma^+\)-game solutions on a rectangular grid ⋮ Minimum light number of lit-only \(\sigma\)-game on a tree ⋮ Chasing the Lights in Lights Out ⋮ Lit-only sigma game on a line graph ⋮ Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game? ⋮ Solutions to all-colors problem on graph cellular automata ⋮ Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs ⋮ A Survey of the Game “Lights Out!” ⋮ Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs
Cites Work
- \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
- Linear cellular automata and the garden-of-eden
- \(\sigma\)-Automata and Chebyshev-polynomials
- Merlin's Magic Square
- Characterizing switch-setting problems∗
- The σ-Game and Cellular Automata
- Merlin's Magic Square Revisited
- Unnamed Item
This page was built for publication: Note on the lamp lighting problem
