An algorithm for constructing magic squares (Q948704)

Magic squares in this paper use distinct consecutive integers for their entries. The authors define a simple \(*\) product on matrices and show that magic squares form a free monoid under \(*\). They also show that \(*\) preserves the ``square palindromic'' property and thus produces infinitely many magic squares with this property. The algorithm referred to in the title is simply that it is possible to create new magic squares by taking the \(*\) product of other magic squares.