Related papers: Commuting Magic Square Matrices
Magic squares have been an enthralling topic in mathematics for centuries. They are formed by filling in all the cells of a square matrix with the numbers starting from one so that the sum of all rows, columns, and diagonals is the same.…
The aim of this note is to introduce fastest new general methods for the construction of double and single even order magic squares. As in [5], the method for double even order magic squares is fairly straight-forward but some adjustments…
We review a general parameterization of an order-3 magic square derived by Lucas and we compound it to produce a parameterized order-9 magic square. Sequential compounding to higher order also is treated. Expressions are found for the…
The aim of this note is to introduce a fast new general method for the construction of double and single even order magic squares. The method for double even order magic squares is fairly straight-forward but some adjustment is necessary…
This paper aims to address the relation between a magic square of odd order $n$ and a group, and their properties. By the modulo number $n$, we construct entries for each table from initial table of magic square with large number $n^2$.…
When doubly-affine matrices such as Latin and magic squares with a single non-zero eigenvalue are powered up they become constant matrices after a few steps. The process of compounding squares of orders m and n can then be used to generate…
Permutation matrices play an important role in understand the structure of magic squares. In this work, we use a class of symmetric permutation matrices than can be used to categorize magic squares. Many magic squares with a high degree of…
The commuting variety of matrices over a given field is a well-studied object in linear algebra and algebraic geometry. As a set, it consists of all pairs of square matrices with entries in that field that commute with one another. In this…
In recreational mathematics, a normal magic square is an $n \times n$ square matrix whose entries are distinctly the integers $1 \ldots n^2$, such that each row, column, and major and minor traces sum to one constant $\mu$. It has been…
We review known factorization results in quaternion matrices. Specifically, we derive the Jordan canonical form, polar decomposition, singular value decomposition, the QR factorization. We prove there is a Schur factorization for commuting…
In this paper, we present the problem of counting magic squares and we focus on the case of multiplicative magic squares of order 4. We give the exact number of normal multiplicative magic squares of order 4 with an original and complete…
A three-dimensional polynomial algebra of order $m$ is defined by the commutation relations $[P_0, P_\pm]$ $=$ $\pm P_\pm$, $[P_+, P_-]$ $=$ $\phi^{(m)}(P_0)$ where $\phi^{(m)}(P_0)$ is an $m$-th order polynomial in $P_0$ with the…
Magic squares are arrangements of natural numbers into square arrays, where the sum of each row, each column, and both diagonals is the same. In this paper, the concept of a magic square with 3 rows and 3 columns is generalized to define…
We find by applying MacMahon's partition analysis that all magic squares of order three, up to rotations and reflections, are of two types, each generated by three basis elements. A combinatorial proof of this fact is given.
Weighted sums of left and right hand Kronecker products of Integer Sequence Doubly Affine (ISDA) as well as Generalized Arithmetic Progression Doubly Affine (GAPDA) arrays are used to generate larger ISDA arrays of multiplicative order…
We present a matrix version of a known method of constructing common eigenvectors of two diagonalizable commuting matrices, thus enabling their simultaneous diagonalization. The matrices may have simple eigenvalues of multiplicity greater…
It is known that semi-magic square matrices form a 2-graded algebra or superalgebra with the even and odd subspaces under centre-point reflection symmetry as the two components. We show that other symmetries which have been studied for…
We give an algorithm that uses only unitary transformations and for each square complex matrix constructs a *congruent matrix that is a direct sum of a nonsingular matrix and singular Jordan blocks.
In this paper we give the first method for constructing n-multimagic squares (and hypercubes) for any n. We give an explicit formula in the case of squares and an effective existence proof in the higher dimensional case. Finally we prove…
We develop a canonical form for congruence of max plus symmetric matrices. We use the same canonical form to get results in the generalized eigenvector problem. We have also utilized the canonical form to find all symmetric matrices that…