Semi-magic dihedral squares
Abstract
Let be a group of order n2 and SMS(n)=(ai,j)n× n be an n× n array whose entries are all distinct elements of . If there exists an element μ∈ such that for every row i, there exists an ordering of elements such that ai,j1 ai,j2 … ai,jn-1 ai,jn = μ and for every column j there exists an ordering of elements such that ai1,j ai2,j … aim-1,j aim,j = μ, then SMS(n) is called a -semi-magic square of side n and μ is called a magic constant. We provide a complete characterization of semi-magic squares of side n whose entries belong to a dihedral group Dk. Moreover, we show that in our constructions a single semi-magic square may admit two distinct magic constants, depending on the order in which the products are computed.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.