Does the lit-only restriction make any difference for the -game and ^+-game?
From MaRDI portal
(Redirected from Publication:1024268)
Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
Recommendations
- Maximum orbit weights in the -game and lit-only -game on grids and graphs
- Lit-only sigma-game on nondegenerate graphs
- 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 pseudo-trees
Cites work
- scientific article; zbMATH DE number 1161323 (Why is no real title available?)
- scientific article; zbMATH DE number 1944403 (Why is no real title available?)
- scientific article; zbMATH DE number 1472133 (Why is no real title available?)
- scientific article; zbMATH DE number 1759684 (Why is no real title available?)
- scientific article; zbMATH DE number 2141600 (Why is no real title available?)
- scientific article; zbMATH DE number 1886332 (Why is no real title available?)
- scientific article; zbMATH DE number 1420902 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- A quick proof on the equivalence classes of extended Vogan diagrams
- Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids
- Complexity of reachability problems for finite discrete dynamical systems
- Eriksson's numbers game and finite Coxeter groups
- Even poset and a parity result for binary linear code
- Extended Vogan diagrams
- Generalized switch-setting problems
- Harmonic evolutions on graphs
- Linear algebra approach to geometric graphs
- Linear cellular automata and the garden-of-eden
- Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs
- Minimum light number of lit-only \(\sigma\)-game on a tree
- More about singular line graphs of trees
- Note on the lamp lighting problem
- On characterization of state transition graph of additive cellular automata based on depth
- On irreversibility of von Neumann additive cellular automata on grids
- On the complexity of dominating set problems related to the minimum all-ones problem
- Parity dominating sets in grid graphs
- Periodic binary harmonic functions on lattices
- Puzzlers' tribute. A feast for the mind
- QUANTUM OCTAL GAMES
- Reachability is decidable in the numbers game
- The Minimum All-Ones Problem for Trees
- Universal configurations in light-flipping games
Cited in
(12)- On a modular domination game.
- Random Lights Out processes on graphs
- Lit-only sigma-game on nondegenerate graphs
- The edge-flipping group of a graph
- The lit-only \(\sigma\)-game: some mathematics behind a puzzle for kids
- Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
- Two-lit trees for lit-only \(\sigma \)-game
- Completely symmetric configurations for \(\sigma \)-games on grid graphs
- Periodic harmonic functions on lattices and points count in positive characteristic
- On the adjacency matrix of a block graph
- Lit-only \(\sigma \)-game on pseudo-trees
- Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs
This page was built for publication: Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024268)
