Numerical Enumeration of Greco-Latin Prime Order Associative Magic Squares
نویسندگان
چکیده
A magic square of order n consists of the numbers 1 to n placed such that the sum of each row, column and principal diagonal equals the magic sum n(n +1)/2. In addition, an odd ordered magic square is associative or self-complementary if diagonally opposite elements have the same sum (n +1)/2. The magic square is said to be regular Greco-Latin if it can be decomposed as a sum of a pair of Latin squares. Here, a numerical construction of associative magic squares based on Bree’s Orthogonality Criterion is presented. This construction method replicates the known algorithms, e.g., the Siamese method and the Pyramid method. Duplications are identified, and this leads to a count of the unique regular Greco-Latin associative magic squares of prime order.
منابع مشابه
Signatura of Magic and Latin Integer Squares: Isentropic Clans and Indexing
The 2010 study of the Shannon entropy of order nine Sudoku and Latin square matrices by Newton and DeSalvo [Proc. Roy. Soc. A 2010] is extended to natural magic and Latin squares up to order nine. We demonstrate that decimal and integer measures of the Singular Value sets, here named SV clans, are a powerful way of comparing different integer squares. Several complete sets of magic and Latin sq...
متن کاملLecture 5 : Latin Squares and Magic
Today's application is to magic! Not the friendship kind, though 1 ; instead, we're going to talk about magic squares, an incredibly old piece of mathematics that we can study using Latin squares. Definition. A magic square is a n × n grid filled with the integers {0, 1,. .. n 2 − 1}, such that • each number is used exactly once in our entire grid, and • the sum of all of the entries along any ...
متن کاملAtomic Latin Squares based on Cyclotomic Orthomorphisms
Atomic latin squares have indivisible structure which mimics that of the cyclic groups of prime order. They are related to perfect 1-factorisations of complete bipartite graphs. Only one example of an atomic latin square of a composite order (namely 27) was previously known. We show that this one example can be generated by an established method of constructing latin squares using cyclotomic or...
متن کاملStrongly symmetric self-orthogonal diagonal Latin squares and Yang Hui type magic squares
Keywords: Self-orthogonal Latin square Strongly symmetric Magic square Yang Hui type a b s t r a c t In this paper, a strongly symmetric self-orthogonal diagonal Latin square of order n with a special property (* SSSODLS(n)) is introduced. It is proved that a * SSSODLS(n) exists if and only if n ≡ 0 (mod 4) and n ̸ = 4. As an application, it is shown that there exists a Yang Hui type magic squar...
متن کاملMagic Squares and Sudoku
We introduce a family of magic squares, called linear magic squares, and show that any parallel linear sudoku solution of sufficiently large order can be relabeled so that all of its subsquares are linear magic. As a consequence, we show that if n has prime factorization p1 1 · · · p kt t and q = min{p k j j | 1 ≤ j ≤ t}, then there is a family of q(q − 1) mutually orthogonal magic sudoku solut...
متن کامل