Groups of rotating squares

MaRDI QIDQ5740801zbMATH OpenFDO

Authors Ravi Montenegro, David A. Huckaby, Elaine White Harmon

Publication date 20 July 2016

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

zbMATH Keywords

grouppermutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: This paper discusses the permutations that are generated by rotating $kimesk$ blocks of squares in a union of overlapping $kimes(k+1)$ rectangles. It is found that the single-rotation parity constraints effectively determine the group of accessible permutations. If there are $n$ squares, and the space is partitioned as a checkerboard with $m$ squares shaded and $n-m$ squares unshaded, then the four possible cases are $A_n$, $S_n$, $A_{m}imes{A}_{n-m}$, and the subgroup of all even permutations in $S_{m}imes{S}_{n-m}$, with exceptions when $k=2$ and $k=3$.

Recommendations

• scientific article; zbMATH DE number 4059405
• scientific article; zbMATH DE number 31193
• Groups of rotationally symmetric permutations and magic mazes
• Packing of permutations into Latin squares
• Slide-and-swap permutation groups.

Cited in

(2)

• Groups of rotationally symmetric permutations and magic mazes
• Blocked triangular patterns and their symmetry groups

This page was built for publication: Groups of rotating squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740801)