格图上sigma-对策的完全对称配置
Completely symmetric configurations for sigma-games on grid graphs
摘要：
本文涉及西格玛游戏网格图（在2维及以上）和条件下，任何完全对称配置的点燃顶点可以达到-特别是完全点燃配置-当开始与所有unlit配置。答案在二维空间中是完整的。在维度大于或等于3的情况下，对于sigma^+ -博弈和sigma^- -博弈，如果至少有一个维度是偶数，则答案是完全的。sigma^-、尺寸大于或等于3且所有尺寸为奇数的情况仍然开放。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
