Most-perfect magic square

੧੨ ੧੪
੧੩ ੧੧
੧੬ ੧०
੧੫
7 12 1 14
2 13 8 11
16 3 10 5
9 6 15 4
transcription of
the indian numerals
Most-perfect magic square from
the Parshvanath Jain temple in Khajuraho

A most-perfect magic square of order n is a magic square containing the numbers 1 to n2 with two additional properties:

  1. Each 2×2 subsquare sums to 2s, where s = n2 + 1.
  2. All pairs of integers distant n/2 along a (major) diagonal sum to s.

Examples

Specific examples of most-perfect magic squares that begin with the 2015 date demonstrate how theory and computer science are able to define this group of magic squares. [1] [2] Only 16 of the 49 2x2 cell blocks that sum to 130 are accented by the different colored fonts in the 8x8 example.

The 12x12 square below was found by making all the 42 principal reversible squares with ReversibleSquares, running Transform1 2All on all 42, making 23040 of each, (of the 23040 x 23040 total each), then making the most-perfect squares from these with ReversibleMost-Perfect. These squares were then scanned for squares with 20,15 in the proper cells for any of the 8 rotations. The 2015 squares all originated with principal reversible square number #31. This square has values that sum to 35 on opposite sides of the vertical midline in the first two rows.[2]

12 × 12 Most-Perfect Magic Square
20 15 60 49 24 51 132 123 92 89 128 87
119 136 79 102 115 100 7 28 47 62 11 64
25 10 65 44 29 46 137 118 97 84 133 82
126 129 86 95 122 93 14 21 54 55 18 57
31 4 71 38 35 40 143 112 103 78 139 76
113 142 73 108 109 106 1 34 41 68 5 70
13 22 53 56 17 58 125 130 85 96 121 94
138 117 98 83 134 81 26 9 66 43 30 45
8 27 48 61 12 63 120 135 80 101 116 99
131 124 91 90 127 88 19 16 59 50 23 52
2 33 42 67 6 69 114 141 74 107 110 105
144 111 104 77 140 75 32 3 72 37 36 39
12 x 12 reversible square #31 of 42
1 2 7 8 13 14 19 20 25 26 31 32
3 4 9 10 15 16 21 2227 28 3334
5 6 1112 17 18 2324 29 30 3536
37 384344 49 5055 56 61 62 6768
39 40 45 46 51525758 63 64 6970
41 42 47 485354596065 66 71 72
73 74 7980858691929798 103 104
75 76 81828788939499100 105 106
77 78 838489909596101102 107108
109 110 115 116121122127128133 134 139 140
111 112 117 118 123124129130 135 136 141142
113 114 119 120 125 126 131 132 137 138 143144

Physical Properties

The image below shows numbers completely surrounded by larger numbers with a blue background.

Magic Space

The Hilbert space filling curve can be divided into 8 cell segments. Each of these segments can be labeled from the beginning of the segment to the end of the segment with the numbers 1 - 8 (b). There are 144 examples of the 8x8 most-perfect magic squares where the 8 cell segments sum to the magic constant of 260 as well as the individual positions in each segment summing to 260. The 1st position is highlighted with a large red font in b) and c) below. The Hilbert curve in a sequential one dimensional representation can be folded and bent into a 2 or 3 dimensional structure. Thus this curve can serve as a Rosetta stone to transition between 2D and 3D magic spaces.[3][4]

Most-perfect space is defined by a structure where the two dimensional Hilbert space filling curve has these magic sums and all the 2x2 planar subsets have the same sum.

All 64 2x2x2 sub cubes and 192 2x2 subsquares sum to 130 in the cube below. (wrap around 2x2 planar squares included).[5]

Properties

All most-perfect magic squares are panmagic squares.

Apart from the trivial case of the first order square, most-perfect magic squares are all of order 4n. In their book, Kathleen Ollerenshaw and David S. Brée give a method of construction and enumeration of all most-perfect magic squares. They also show that there is a one-to-one correspondence between reversible squares and most-perfect magic squares.

For n = 36, there are about 2.7 × 1044 essentially different most-perfect magic squares.

The second property above implies that each pair of the integers with the same background colour in the 4×4 square below have the same sum, and hence any 2 such pairs sum to the magic constant.

7 12 1 14
2 13 8 11
16 3 10 5
9 6 15 4

See also

Notes

References

External links

This article is issued from Wikipedia - version of the Saturday, April 30, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.