Magic series

A magic series is a set of distinct positive numbers which add up to the magic constant of a magic square and a magic cube, thus potentially making up lines in magic tesseracts.

So, in an n × n magic square using the numbers from 1 to n2, a magic series is a set of n distinct numbers adding up to n(n2+1)/2. For n = 2, there are just two magic series, 1+4 and 2+3. The eight magic series when n = 3 all appear in the rows, columns and diagonals of a 3 × 3 magic square.

Maurice Kraitchik gave the number of magic series up to n = 7 in Mathematical Recreations in 1942 (sequence A052456 in the OEIS). In 2002, Henry Bottomley extended this up to n = 36 and independently Walter Trump up to n = 32. In 2005, Trump extended this to n = 54 (over 2×10111) while Bottomley gave an experimental approximation for the numbers of magic series:

In July 2006, Robert Gerbicz extended this sequence up to n = 150.

In 2013 Dirk Kinnaes was able to exploit his insight that the magic series could be related to the volume of a polytope. Walter Trump used this new approach to extend the sequence up to n = 1000.[1]

Mike Quist showed that the exact second-order count has a multiplicative factor of equivalent to a denominator of [2]


Richard Schroeppel in 1973 was able to give the complete enumeration of the order 5 magic square at 275,305,224. This recent magic series work gives hope that the relationship between the magic series and the magic square may provide an exact count for order 6 or order 7 magic squares. Consider an intermediate structure that lies in complexity between the magic series and the magic square. It might be described as an amalgamation of 4 magic series that have only one unique common integer. This structure forms the two major diagonals and the central row and column for an odd order magic square. Building blocks such as these could be the way forward.


References

  1. Walter Trump http://www.trump.de/magic-squares/
  2. Mike Quist, Asymptotic enumeration of magic series, 2013 http://arxiv.org/abs/1306.0616 /


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.