Constructing Pandiagonal Latin Squares from Linear Cellular Automaton on Elementary Abelian Groups

DOI10.1002/jcd.21414zbMath1316.05016OpenAlexW1940678198MaRDI QIDQ5256483

Tiankuang Wu, Vahid Dabbaghian

Publication date: 17 June 2015

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21414

zbMATH Keywords

cellular automatonpandiagonal Latin squareselementary abelian groups\(\lambda\)-shifted update function

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Cellular automata (computational aspects) (68Q80)

Related Items (1)

Recursive construction of non-cyclic pandiagonal Latin squares

Cites Work

• Unnamed Item
• Recursive construction of non-cyclic pandiagonal Latin squares
• Enumeration and construction of pandiagonal Latin squares of prime order
• A survey of known results and research areas for \(n\)-queens
• A complete solution to the existence and nonexistence of Knut Vik designs and orthogonal Knut Vik designs
• Invariant measures for bipermutative cellular automata
• On a characterization of locally finite groups in terms of linear cellular automata
• Constructing orthogonal pandiagonal Latin squares and panmagic squares from modularn-queens solutions
• On the design of experiments under spatial correlation
• Asymptotic randomization of subgroup shifts by linear cellular automata
• Cellular automata, quasigroups and symmetries

This page was built for publication: Constructing Pandiagonal Latin Squares from Linear Cellular Automaton on Elementary Abelian Groups