Completely symmetric configurations for σ-games on grid graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Algebraic Combinatorics Année : 2010

Completely symmetric configurations for σ-games on grid graphs

(1) , (2)
1
2

Résumé

The paper deals with s-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 =3, the answer is complete for the s +-game, and for the s --game if at least one of the sizes is even. The case s -, dimension =3 and all sizes odd remains open. © Springer Science+Business Media, LLC 2009.

Dates et versions

hal-00835228 , version 1 (18-06-2013)

Identifiants

Citer

M. Florence, Frédéric Meunier. Completely symmetric configurations for σ-games on grid graphs. Journal of Algebraic Combinatorics, 2010, 31 (4), pp.533-545. ⟨10.1007/s10801-009-0199-7⟩. ⟨hal-00835228⟩
43 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More