相关论文: Constructing All Magic Squares of Order Three

General methods for the construction of magic squares of any order have been searched for centuries. There have been several standard strategies for this purpose, such as the knight movement, or the construction of bordered magic squares,…

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…

Using computational algebraic geometry techniques and Hilbert bases of polyhedral cones we derive explicit formulas and generating functions for the number of magic squares and magic cubes.

We present an exact method for counting semi-magic squares of order 6. Some theoretical investigations about the number of them and a probabilistic method are presented. Our calculations show that there are exactly…

By using two different invariants for the Rubik's Magic puzzle, one of metric type, the other of topological type, we can dramatically reduce the universe of constructible configurations of the puzzle. Finding the set of actually…

We demonstrate the existence of $K$-multimagic squares of order $N$ consisting of distinct integers whenever $N>2 K(K+1)$. This improves upon our earlier result in which we only required $N+1$ distinct integers. Additionally, we present a…

We show how Coxeter's work implies a bijection between complex reflection groups of rank two and real reflection groups in $O(3)$. We also consider this magic square of reflections and rotations in the framework of Clifford algebras: we…

We show that the mapping class group of a closed oriented surface of genus at least three is generated by 3 elements of order 3 and by 4 elements of order 4. Note that the mapping class group cannot be generated by finitely many torsion…

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…

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 introduce Magic Gems, a geometric representation of magic squares as three-dimensional polyhedra. By mapping an n times n magic square onto a centered coordinate grid with cell values as vertical displacements, we construct a point cloud…

We show the 3 by 3 magic square of squares problem equivalent to solving quartic polynomials with certain factorization constraints over an abelian extension of the rationals. We analyze a particular case in which said extension is assumed…

A proof that there is no $3 \times 3$ magic square constructed with nine distinct square numbers is given.

We present systematic methods of constructing pandiagonal sudoku squares of order k*k and Knut Vik sudoku squares of order k*k not divisible by 2 or 3. Pandiagonal magic squares are constructed from these squares. Examples of all these…

A magic square of order n is an nxn square (matrix) whose entries are distinct nonnegative integers such that the sum of the numbers of any row and column is the same number, the magic constant. In this paper we introduce the concept of…

Let $\Gamma$ be a group of order $n^2$ and $SMS_{\Gamma}(n)=(a_{i,j})_{n\times n}$ be an $n\times n$ array whose entries are all distinct elements of $\Gamma$. If there exists an element $\mu\in\Gamma$ such that for every row $i$, there…

This article studies a generalization of magic squares to finite projective planes. In traditional magic squares the entries come from the natural numbers. This does not work for finite projective planes, so we instead use Abelian groups.…

For prime $p$ we define magic squares of order $kp^3$, called type-$p$ Franklin squares, whose properties specialize to those of classical Franklin squares in the case $p=2$. We construct type-$p$ Franklin squares in prime-power orders.

Magic squares are a fascinating mathematical challenge that has intrigued mathematicians for centuries. Given a positive (and possibly large) integer \( n \), one of the main challenges that still remains is to find, within a computational…

Several specific Franklin squares and magic squares are decomposed into their quotient and remainder squares. The results support the conjecture that Franklin used the Eulerian composition method to construct many of his squares. This…