Characterizing switch-setting problems∗

DOI10.1080/03081089708818520zbMATH Open0890.15004OpenAlexW1998859367MaRDI QIDQ4376554FDOQ4376554

Authors: William F. Klostermeyer, John Goldwasser, George E. Trapp 

Publication date: 29 June 1998

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081089708818520

Recommendations

• On a switch-setting problem arising from a variation of the `Lights Out' game
• The solution to Berlekamp's switching game
• scientific article; zbMATH DE number 1161323
• How to turn all the lights out

zbMATH Keywords

switchesbinary matrixFibonacci polynomialsgreatest common divisorfinite field representation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of matrix inversion and generalized inverses (15A09) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (15)

• Random Lights Out processes on graphs
• A non-geometric switch toggling problem
• Chasing the lights in Lights Out
• The density of ones in Pascal's rhombus
• Note on the lamp lighting problem
• 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
• Lights Out On A Random Graph
• Lights Out! On graph products over the ring of integers modulo \(k\)
• A Survey of the Game “Lights Out!”
• ``Lights Out and variants
• Parity Dimension for Graphs - A Linear Algebraic Approach
• On the complexity of dominating set problems related to the minimum all-ones problem
• Cyclic mutually unbiased bases, Fibonacci polynomials and Wiedemann's conjecture
• Lights Out on graphs

This page was built for publication: Characterizing switch-setting problems^∗

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376554)