Note on the Lamp Lighting Problem
✍ Scribed by Henrik Eriksson; Kimmo Eriksson; Jonas Sjöstrand
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 143 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
✦ Synopsis
We answer some questions concerning the so-called σ-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 × n grid is odd or even.
📜 SIMILAR VOLUMES
Entering her third season, Sophie Fournier has almost everything she wants. She’s the captain of the Concord Condors, she’s roommates and linemates with Elsa Nyberg, the elite Swedish winger she’s wanted to play alongside since the Zurich U-Tourney. There are two major things she’s missing, though.
We consider problems in the enumeration of sequences suggested by the problem of determining the number of ways of performing a piano composition (Klavierstu ck XI) by Karlheinz Stockhausen.
A remarkable feature of barrier penetration in quantum theory is that a particle tunneling through a barrier appears to do so in zero time. We analyze the conditions that would make possible an actual measurement of an anomalously short traversal time and conclude that such a measurement cannot be m