Latin square matrices and their inverses

2019 ◽  
Vol 103 (557) ◽  
pp. 265-276
Author(s):  
K. Robin McLean

Magic squares have long been popular in recreational mathematics. Their potential for introducing students to ideas in linear algebra was recognised over forty years ago in [1] and later in [2]. More recently they have proved to be a fascinating topic for undergraduate exploration, especially when students have access to a computer algebra package [3]. Some results on powers of magic square matrices can be found in [4], [5] and [6]. (Readers who google the title ‘Odd magic powers’ of Thompson’s paper [5] will be treated to a wide variety of non-mathematical exotica!)

Author(s):  
Thitarie Rungratgasame ◽  
Pattharapham Amornpornthum ◽  
Phuwanat Boonmee ◽  
Busrun Cheko ◽  
Nattaphon Fuangfung

The definition of a regular magic square motivates us to introduce the new special magic squares, which are reflective magic squares, corner magic squares, and skew-regular magic squares. Combining the concepts of magic squares and linear algebra, we consider a magic square as a matrix and find the dimensions of the vector spaces of these magic squares under the standard addition and scalar multiplication of matrices by using the rank-nullity theorem.


Author(s):  
Sahab Dheyaa Mohammed ◽  
Taha Mohammed Hasan

<p>Hackers should be prevented from disclosing sensitive data when sent from one device to another over the network. Therefore, the proposed method was established to prevent the attackers from exploiting the vulnerabilities of the redundancy in the ciphertext and enhances the substitution and permutation operations of the encryption process .the solution was performed by eliminates these duplicates by hiding the ciphertext into a submatrix 4 x4 that chooses randomly from magic square 16x16 in each ciphering process. Two techniques of encrypted and hiding were executed in the encryption stage by using a magic square size 3 × 3   and Latin square size 3 × 3 to providing more permutation and also to ensure an inverse matrix of decryption operation be available. In the hiding stage, the ciphertext was hidden into a 16×16 matrix that includes 16 sub-magic squares to eliminate the duplicates in the ciphertext. Where all elements that uses were polynomial numbers of a finite field of degree Galois Fields GF ( ).  The proposed technique is robust against disclosing the repetition encrypted data based on the result of Avalanche Effect in an accepted ratio (62%) and the results of the output of the proposed encryption method have acceptable randomness based on the results of the p-values (0.629515) of the National Institute of Standards and Technology (NIST) randomness tests. The work can be considered significant in the field of encrypting databases because the repetition of encrypted data inside databases is considered an important vulnerability that helps to guess the plaintext from the encrypted text.</p>


Author(s):  
Robin Wilson

‘Square arrays’ is concerned with magic squares and latin squares. An n × n magic square, or a magic square of order n, is a square array of numbers (usually the numbers from 1 to n 2) arranged so that the sum of the numbers in each of the n rows, each of the n columns, or each of the two main diagonals is the same. A latin square of order n, is a square array with n symbols arranged so that each symbol appears just once in each row and each column. Orthogonal latin squares are also discussed along with Euler’s 36 officers problem.


Author(s):  
Stewart Hengeveld ◽  
Giancarlo Labruna ◽  
Aihua Li

A magic square M M over an integral domain D D is a 3 × 3 3\times 3 matrix with entries from D D such that the elements from each row, column, and diagonal add to the same sum. If all the entries in M M are perfect squares in D D , we call M M a magic square of squares over D D . In 1984, Martin LaBar raised an open question: “Is there a magic square of squares over the ring Z \mathbb {Z} of the integers which has all the nine entries distinct?” We approach to answering a similar question when D D is a finite field. We claim that for any odd prime p p , a magic square over Z p \mathbb Z_p can only hold an odd number of distinct entries. Corresponding to LaBar’s question, we show that there are infinitely many prime numbers p p such that, over Z p \mathbb Z_p , magic squares of squares with nine distinct elements exist. In addition, if p ≡ 1 ( mod 120 ) p\equiv 1\pmod {120} , there exist magic squares of squares over Z p \mathbb Z_p that have exactly 3, 5, 7, or 9 distinct entries respectively. We construct magic squares of squares using triples of consecutive quadratic residues derived from twin primes.


2020 ◽  
Vol 35 (29) ◽  
pp. 2050183
Author(s):  
Yuta Hyodo ◽  
Teruyuki Kitabayashi

The magic texture is one of the successful textures of the flavor neutrino mass matrix for the Majorana type neutrinos. The name “magic” is inspired by the nature of the magic square. We estimate the compatibility of the magic square with the Dirac, instead of the Majorana, flavor neutrino mass matrix. It turned out that some parts of the nature of the magic square are appeared approximately in the Dirac flavor neutrino mass matrix and the magic squares prefer the normal mass ordering rather than the inverted mass ordering for the Dirac neutrinos.


1991 ◽  
Vol 98 (6) ◽  
pp. 481-488 ◽  
Author(s):  
Christopher J. Henrich
Keyword(s):  

2005 ◽  
Vol 112 (2) ◽  
pp. 155-164
Author(s):  
Ian Doust ◽  
Michael D. Hirschhorn ◽  
Jocelyn Ho

2017 ◽  
Vol 5 (1) ◽  
pp. 82-96 ◽  
Author(s):  
Xiaoyang Ma ◽  
Kai-tai Fang ◽  
Yu hui Deng

Abstract In this paper we propose a new method, based on R-C similar transformation method, to study classification for the magic squares of order 5. The R-C similar transformation is defined by exchanging two rows and related two columns of a magic square. Many new results for classification of the magic squares of order 5 are obtained by the R-C similar transformation method. Relationships between basic forms and R-C similar magic squares are discussed. We also propose a so called GMV (generating magic vector) class set method for classification of magic squares of order 5, presenting 42 categories in total.


1974 ◽  
Vol 21 (5) ◽  
pp. 439-441
Author(s):  
David L. Pagni

A magic square of nth order is a square array of n rows and n columns whose components are n^2 distinct integers. Furthermore, the sum of the numbers in any row, column, or main diagonal must always equal a constant—the “magic constant.– The array in figure I, then, is a magic square of 3rd order whose magic constant is the number 15.


1978 ◽  
Vol 26 (2) ◽  
pp. 36-38
Author(s):  
John E. Bernard

How often have you seen children fill page after page with tic-tac-toe games and hoped for a way to direct their energy and enthusiasm into the learning of mathematics? This article describes how magic squares can be used to generate an assortment of number games that are “the same as” tic-tac-toe. Perhaps these games will be prized not only for their educational value, but also because they provide tic-tac-toe with stiff competition in the “interest- getting department.”


Sign in / Sign up

Export Citation Format

Share Document