SearcharxivSearch

arXiv · 2601.06131

Algebraic Classification of All 880 Fourth-Order Magic Squares and the Discovery of Complete Alternating Magic Squares

Abstract

In this paper, we introduce a newly defined algebraic invariant for square matrices termed the \emph{Alternating Power Difference (APD)}. The APD is defined as the signed sum of the powers of diagonal sums along permutations of the symmetric group, distinguishing between even and odd permutations. It serves as a measure of the broken even-odd symmetry inherent in a matrix through higher-order moments. We applied this invariant to all 880 essentially different normal $4\times4$ magic squares (excluding symmetries) and defined the \emph{First Appearance Degree} $m_1$ as the minimum power at which the APD first becomes non-zero. Through an exhaustive computational search, we found that these magic squares are categorized into three clearly separated classes: $m_1=3$ (240 squares), $m_1=4$ (624 squares), and $m_1=\infty$ (16 squares). In particular, the case $m_1=\infty$ identifies exceptionally rare magic squares for which the APD vanishes at all degrees. We refer to these as \emph{Complete Alternating Magic Squares} and demonstrate that they possess a strong algebraic symmetry undetectable by conventional geometric classifications or link-line patterns. Furthermore, we reveal that the APD-based classification refines the classical link-line classification based on complementary sum pairs, showing that each geometric type is clearly distinguished by its first appearance degree. All results in this paper are based on exhaustive computations and are fully reproducible. Our findings suggest that the APD is an effective new invariant for detecting hidden algebraic structures in magic squares and related combinatorial matrices.

Explore related subjects

Keep this discovery

BibTeXRIS

Kenichi Takemura. 2026-01-05. Algebraic Classification of All 880 Fourth-Order Magic Squares and the Discovery of Complete Alternating Magic Squares. https://arxiv.org/abs/2601.06131

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM