Completely symmetric configurations for \(\sigma \)-games on grid graphs

DOI10.1007/s10801-009-0199-7zbMath1227.05199arXiv0903.0339OpenAlexW2016198570MaRDI QIDQ976843

Frédéric Meunier, Mathieu Florence

Publication date: 16 June 2010

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0903.0339

zbMATH Keywords

commutative algebragrid graphsChebychev polynomialssigma-games

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Polynomials over finite fields (11T06) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
• Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
• Linear cellular automata and the garden-of-eden
• \(\sigma\)-Automata and Chebyshev-polynomials
• Unnamed Item

This page was built for publication: Completely symmetric configurations for \(\sigma \)-games on grid graphs