Completely symmetric configurations for sigma-games on grid graphs

Details Completely symmetric configurations for sigma-games on grid graphs Completely symmetric configurations for sigma-games on grid graphs

2009-03-02

arxiv.org/abs/0903.0339v2

Mathematics

Combinatorics

The bibliography has been corrected

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Completely symmetric configurations for sigma-games on grid graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Completely symmetric configurations for sigma-games on grid graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Completely symmetric configurations for sigma-games on grid graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-78442