The σ⁻-game on grids with all sides odd, in every dimension

In the σ⁻-game on a graph, pressing a vertex toggles the lights of its neighbours but not its own. Florence and Meunier determined when every completely symmetric configuration, in particular the all-on one, can be reached from the all-off configuration on grid graphs, except for the σ⁻-game in dimension d ≥ 3 with all sizes odd. We settle that case for the two usual neighbourhoods, edge and king, in every dimension. With a(n) = v_2(n+1), the exponent of the highest power of 2 dividing n+1, the all-on configuration (equivalently, every completely symmetric configuration) is reachable if and only if some value of a(n_i), among the sizes n_i ≡ 3 (mod 4), occurs an odd number of times.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-12
DOI
https://doi.org/10.5281/zenodo.24167504
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The σ⁻-game on grids with all sides odd, in every dimension

Emanuele Rizzan
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

The σ⁻-game on grids with all sides odd, in every dimension

Emanuele Rizzan
preprint en

Abstract

In the σ⁻-game on a graph, pressing a vertex toggles the lights of its neighbours but not its own. Florence and Meunier determined when every completely symmetric configuration, in particular the all-on one, can be reached from the all-off configuration on grid graphs, except for the σ⁻-game in dimension d ≥ 3 with all sizes odd. We settle that case for the two usual neighbourhoods, edge and king, in every dimension. With a(n) = v_2(n+1), the exponent of the highest power of 2 dividing n+1, the all-on configuration (equivalently, every completely symmetric configuration) is reachable if and only if some value of a(n_i), among the sizes n_i ≡ 3 (mod 4), occurs an odd number of times.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon