Related papers: Squaring the magic squares of order 4
The problem of representing a given positive integer as a sum of four squares of integers has been widely concerned for a long time, and for a given positive odd $n$ one can find a representation by doing arithmetic in a maximal order of…
We find by applying MacMahon's partition analysis that all magic labellings of the cube are of eight types, each generated by six basis elements. A combinatorial proof of this fact is given. The number of magic labellings of the cube is…
We adress the problem of the reasons for the existence of 12 symmetric spaces with the exceptional Lie groups. The 1+2 cases for $G_2$ and $F_4$ respectively are easily explained from the octonionic nature of these groups. The 4+3+2 cases…
We propose a simple algorithm for generating Binary Magic Squares (BMS), i.e., square binary matrices where the sum of all rows and all columns are equal. We show by induction that our algorithm always returns valid BMS with optimal…
We find the numbers of $3 \times 3$ magic, semimagic, and magilatin squares, as functions either of the magic sum or of an upper bound on the entries in the square. Our results on magic and semimagic squares differ from previous ones in…
The problem of the construction of magic squares occupied many mathematicians of the 17th century. The Polish Jesuit and polymath Adam Adamandy Kocha\'nski studied this subject too, and in 1686 he published a paper in Acta Eruditorum titled…
Recently the author used certain quaternion orders to demonstrate the universality of some quaternary quadratic forms. Here a further study is done on one of these orders analogous to Hurwitz's proof of the formula for the number of…
This article looks at the eigenvalues of magic squares generated by the MATLAB's magic($n$) function. The magic($n$) function constructs doubly even ($n = 4k$) magic squares, singly even ($n = 4k+2$) magic squares and odd ($n = 2k+1$) magic…
In this short note we have produced different kinds of bimagic squares using only the digits 0, 1, 2, 5 and 8. The universal bimagic squares presented are of order 8x8, 9x9, 16x16 and 25x25. In order to bring universal bimagic square of…
In this paper, we present a new method for solving standard quaternion equations. Using this method we reobtain the known formulas for the solution of a quadratic quaternion equation, and provide an explicit solution for the cubic…
We present a randomized algorithm, which, given positive integers n and t and a real number 0< epsilon <1, computes the number Sigma(n, t) of n x n non-negative integer matrices (magic squares) with the row and column sums equal to t within…
Orthogonal matrices which are linear combinations of permutation matrices have attracted enormous attention in quantum information and computation. In this paper, we provide a complete parametric characterization of all complex, real and…
The quest for non-commutative matrix multiplication algorithms in small dimensions has seen a lot of recent improvements recently. In particular, the number of scalar multiplications required to multiply two $4\times4$ matrices was first…
A magic square of order $n$ with all subsquares of possible orders (ASMS$(n)$) is a magic square which contains a general magic square of each order $k\in\{3, 4, \cdots, n-2\}$. Since the conjecture on the existence of an ASMS was proposed…
Let $(\Gamma,+)$ be an Abelian group of order $n^2$ and MS$_{\Gamma}(n)$ be an $n\times n$ array whose entries are all elements of $\Gamma$. Then MS$_{\Gamma}(n)$ is a $\Gamma$-magic square if all row, column, main and backward main…
The sudoku puzzles have a long history, with variations going back more than a hundred years, but its current and perhaps surprising world-wide prominence goes back to certain initiatives and then puzzle-generating computer programmes from…
Magic-square constraints define Diophantine systems whose solutions, in several natural families, exhibit rigid periodic structure. We study this structure in an oracle setting, where a marked set of integers is given by black-box access…
We show arithmetic triplets of Gaussian squares are in 3-to-1 correspondence with Pythagorean triples thereof. This correspondence would transform a solution to the Magic Square of Squares puzzle into a larger structure of perfect Gaussian…
We describe a generalization of most-perfect magic squares, called type-p most-perfect squares, and in prime-power orders we give a linear construction of these squares reminiscent of de la Loubere's classical magic square construction…
For any $d \geq 2$, we prove that there exists an integer $n_0(d)$ such that there exists an $n \times n$ magic square of $d^\text{th}$ powers for all $n \geq n_0(d)$. In particular, we establish the existence of an $n \times n$ magic…