Completely symmetric configurations for sigma-games on grid graphs
| dc.creator | Florence, Mathieu | |
| dc.creator | Meunier, Frédéric | |
| dc.date | 2009-03-02 | |
| dc.date | 2009-03-03 | |
| dc.date.accessioned | 2026-07-07T12:48:12Z | |
| dc.date.available | 2026-07-07T12:48:12Z | |
| dc.description | The paper deals with sigma-games on grid graphs (in dimension 2 and more) and conditions under which any completely symmetric configuration of lit vertices can be reached -- in particular the completely lit configuration -- when starting with the all-unlit configuration. The answer is complete in dimension 2. In dimension greater than or equal to 3, the answer is complete for the sigma^+ -game, and for the sigma^- -game if at least one of the sizes is even. The case sigma^-, dimension greater than or equal to 3 and all sizes odd remains open. | |
| dc.description | The bibliography has been corrected | |
| dc.identifier | https://arxiv.org/abs/0903.0339 | |
| dc.identifier | http://arxiv.org/abs/0903.0339 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/221974 | |
| dc.subject | Combinatorics | |
| dc.subject | Rings and Algebras | |
| dc.subject | 05B30, 37B15 | |
| dc.title | Completely symmetric configurations for sigma-games on grid graphs | |
| dc.type | text |