Constructing all magic squares of order three
From MaRDI portal
Abstract: We find by applying MacMahon's partition analysis that all magic squares of order three, up to rotations and reflections, are of two types, each generated by three basis elements. A combinatorial proof of this fact is given.
Recommendations
Cites work
- A fast algorithm for MacMahon's partition analysis
- scientific article; zbMATH DE number 1618172 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 2209709 (Why is no real title available?)
- MacMahon's partition analysis. VI: A new reduction algorithm
- MacMahon's partition analysis: The Omega package
- The Number of "Magic" Squares, Cubes, and Hypercubes
- The zen of magic squares, circles, and stars. An exhibition of surprising structures across dimensions
Cited in
(6)- A fast algorithm for computing the number of magic series
- Enumeration of \(4 \times 4\) magic squares
- scientific article; zbMATH DE number 4097404 (Why is no real title available?)
- scientific article; zbMATH DE number 28774 (Why is no real title available?)
- Partitions for Semi-magic Squares of Size Three
- On magic distinct labellings of simple graphs
This page was built for publication: Constructing all magic squares of order three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932615)