Pages that link to "Item:Q1978501"

The following pages link to \(\sigma\)-Automata and Chebyshev-polynomials (Q1978501):

Displaying 26 items.

• Random Lights Out processes on graphs (Q394801) (← links)
• A singular quartic curve over a finite field and the trisentis game (Q549271) (← links)
• Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids (Q596114) (← links)
• The general \(\sigma \) all-ones problem for trees (Q944730) (← links)
• Completely symmetric configurations for \(\sigma \)-games on grid graphs (Q976843) (← links)
• Minimum light number of lit-only \(\sigma\)-game on a tree (Q995589) (← links)
• Periodic harmonic functions on lattices and points count in positive characteristic (Q1040214) (← links)
• Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices (Q1128666) (← links)
• Linear cellular automata with boundary conditions (Q1595125) (← links)
• Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions (Q1750043) (← links)
• Solutions to all-colors problem on graph cellular automata (Q2325123) (← links)
• Periodic harmonic functions on lattices and Chebyshev polynomials (Q2346606) (← links)
• On weight-one solvable configurations of the Lights Out puzzle (Q2424276) (← links)
• On the complexity of dominating set problems related to the minimum all-ones problem (Q2456358) (← links)
• Generalized switch-setting problems (Q2461202) (← links)
• Periodic binary harmonic functions on lattices (Q2474258) (← links)
• On irreversibility of von Neumann additive cellular automata on grids (Q2489910) (← links)
• A Survey of the Game “Lights Out!” (Q2848975) (← links)
• Cyclic mutually unbiased bases, Fibonacci polynomials and Wiedemann's conjecture (Q2865462) (← links)
• On the Dimension of the Space of Harmonic Functions on a Discrete Torus (Q2911517) (← links)
• Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs (Q3439135) (← links)
• Chasing the Lights in Lights Out (Q4692176) (← links)
• Parity Dimension for Graphs - A Linear Algebraic Approach (Q4796507) (← links)
• Note on the lamp lighting problem (Q5956771) (← links)
• Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) (Q6118641) (← links)
• A family of multicolor lights out games (Q6560773) (← links)