Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?

DOI10.1016/j.ejc.2008.09.020zbMath1169.91011OpenAlexW2031414850MaRDI QIDQ1024268

Yaokun Wu, Xinmao Wang, John L. Goldwasser

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.09.020

zbMATH Keywords

reachabilityorbitconfigurationline graphlit-only sigma gametoggle

Mathematics Subject Classification ID

Games involving graphs (91A43) Combinatorial games (91A46)

Related Items (9)

Lit-only \(\sigma \)-game on pseudo-trees ⋮ Random Lights Out processes on graphs ⋮ Two-lit trees for lit-only \(\sigma \)-game ⋮ On the adjacency matrix of a block graph ⋮ The edge-flipping group of a graph ⋮ Completely symmetric configurations for \(\sigma \)-games on grid graphs ⋮ Periodic harmonic functions on lattices and points count in positive characteristic ⋮ Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs ⋮ Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs

Cites Work

• Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids
• Even poset and a parity result for binary linear code
• Complexity of reachability problems for finite discrete dynamical systems
• Eriksson's numbers game and finite Coxeter groups
• Minimum light number of lit-only \(\sigma\)-game on a tree
• Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs
• On characterization of state transition graph of additive cellular automata based on depth
• Reachability is decidable in the numbers game
• Linear cellular automata and the garden-of-eden
• A quick proof on the equivalence classes of extended Vogan diagrams
• On the complexity of dominating set problems related to the minimum all-ones problem
• Linear algebra approach to geometric graphs
• Generalized switch-setting problems
• Periodic binary harmonic functions on lattices
• On irreversibility of von Neumann additive cellular automata on grids
• Extended Vogan diagrams
• The Minimum All-Ones Problem for Trees
• More about singular line graphs of trees
• Harmonic evolutions on graphs
• QUANTUM OCTAL GAMES
• Note on the lamp lighting problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?