An algorithm for constructing magic squares
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(11)- The free semigroup of magic squares
- Construction of normal bimagic squares of order \(2u\)
- A fast algorithm for computing the number of magic series
- Magic "Squares" Indeed!
- scientific article; zbMATH DE number 5670402 (Why is no real title available?)
- scientific article; zbMATH DE number 1763304 (Why is no real title available?)
- Some properties of magic cubes
- Existence of Yang Hui type magic squares
- scientific article; zbMATH DE number 7267348 (Why is no real title available?)
- scientific article; zbMATH DE number 5039908 (Why is no real title available?)
- scientific article; zbMATH DE number 4183430 (Why is no real title available?)
This page was built for publication: An algorithm for constructing magic squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948704)