Note on the lamp lighting problem
2001 (English)In: Advances in Applied Mathematics, ISSN 0196-8858, E-ISSN 1090-2074, Vol. 27, no 03-feb, 357-366 p.Article in journal (Refereed) Published
We answer some questions concerning the so-called sigma -game of Sutner [Linear cellular automata and the Garden of Eden, Math. Intelligencer 11 (1989), 49-53]. It is played on a graph where each vertex has a lamp, the light of which is toggled by pressing any vertex with an edge directed to the lamp. For example, we show that every configuration of lamps can be lit if and only if the number of complete matchings in the graph is odd. In the special case of an orthogonal grid one gets a criterion for whether the number of monomer-dimer tilings of an m x n grid is odd or even.
Place, publisher, year, edition, pages
2001. Vol. 27, no 03-feb, 357-366 p.
IdentifiersURN: urn:nbn:se:kth:diva-21110ISI: 000172251600010OAI: oai:DiVA.org:kth-21110DiVA: diva2:339807
QC 201005252010-08-102010-08-10Bibliographically approved