Magic hyperbeam

From Wikipedia, the free encyclopedia
Jump to: navigation, search

A magic hyperbeam (n-dimensional magic rectangle) is a variation on a magic hypercube where the orders along each direction may be different. As such a magic hyperbeam generalises the two dimensional magic rectangle and the three dimensional magic beam, a series that mimics the series magic square, magic cube and magic hypercube. This article will mimic the magic hypercubes article in close detail, and just as that article serves merely as an introduction to the topic.

Conventions[edit]

It is customary to denote the dimension with the letter 'n' and the orders of a hyperbeam with the letter 'm' (appended with the subscripted number of the direction it applies to).

  • (n) Dimension : the amount of directions within a hyperbeam.
  • (mk) Order : the amount of numbers along kth monagonal k = 0, ..., n − 1.

Further: In this article the analytical number range [0..k=0n-1mk-1] is being used.

Notations[edit]

in order to keep things in hand a special notation was developed:

  • [ ki; k=[0..n-1]; i=[0..mk-1] ]: positions within the hyperbeam
  • < ki; k=[0..n-1]; i=[0..mk-1] >: vectors through the hyperbeam

Note: The notation for position can also be used for the value on that position. There where it is appropriate dimension and orders can be added to it thus forming: n[ki]m0,..,mn-1

Construction[edit]

Basic[edit]

Description of more general methods might be put here, I don't often create hyperbeams, so I don't know whether Knightjump or Latin Prescription work here. Other more adhoc methods suffice on occasion I need a hyperbeam.

Multiplication[edit]

Amongst the various ways of compounding, the multiplication[1] can be considered as the most basic of these methods. The basic multiplication is given by:

nB(m..)1 * nB(m..)2 : n[ki](m..)1(m..)2 = n[ [[ki \ mk2]](m..)1k=0n-1mk1](m..)2 + [ki % mk2](m..)2](m..)1(m..)2

(m..) abbreviates: m0,..,mn-1.
(m..)1(m..)2 abbreviates: m01m02,..,mn-11mn-12.

Curiosities[edit]

all orders are either even or odd[edit]

A fact that can be easily seen since the magic sums are:

Sk = mk (j=0n-1mj - 1) / 2

When any of the orders mk is even, the product is even and thus the only way Sk turns out integer is when all mk are even.
Thus suffices: all mk are either even or odd.

This is with the exception of mk=1 of course, which allows for general identities like:

  • Nmt = Nm,1 * N1,m
  • Nm = N1,m * Nm,1

Which goes beyond the scope of this introductory article

Only one direction with order = 2[edit]

since any number has but one complement only one of the directions can have mk = 2.

Aspects[edit]

A hyperbeam knows 2n Aspectial variants, which are obtained by coördinate reflection ([ki] --> [k(-i)]) effectively giving the Aspectial variant:

nB(m0..mn-1)~R ; R = k=0n-1 ((reflect(k)) ? 2k : 0) ;

Where reflect(k) true iff coördinate k is being reflected, only then 2k is added to R.

In case one views different orientations of the beam as equal one could view the number of aspects n! 2n just as with the magic hypercubes, directions with equal orders contribute factors depending on the hyperbeam's orders. This goes beyond the scope of this article.

Basic manipulations[edit]

Besides more specific manipulations, the following are of more general nature

  • ^[perm(0..n-1)] : coördinate permutation (n == 2: transpose)
  • _2axis[perm(0..m-1)] : monagonal permutation (axis ε [0..n-1])

Note: '^' and '_' are essential part of the notation and used as manipulation selectors.

Coördinate permutation[edit]

The exchange of coördinaat [ki] into [perm(k)i], because of n coördinates a permutation over these n directions is required.
The term transpose (usually denoted by t) is used with two dimensional matrices, in general though perhaps "coördinaatpermutation" might be preferable.

Monagonal permutation[edit]

Defined as the change of [ki] into [kperm(i)] alongside the given "axial"-direction. Equal permutation along various axes with equal orders can be combined by adding the factors 2axis. Thus defining all kinds of r-agonal permutations for any r. Easy to see that all possibilities are given by the corresponding permutation of m numbers.

normal position[edit]

In case no restrictions are considered on the n-agonals a magic hyperbeam can be represented shown in "normal position" by:

[ki] < [k(i+1)] ; i = 0..mk-2 (by monagonal permutation)

Qualification[edit]

Qualifying the hyperbeam is less developed then it is on the magic hypercubes in fact only the k'th monagonal direction need to sum to:

Sk = mk (j=0n-1mj - 1) / 2

for all k = 0..n-1 for the hyperbeam to be qualified {magic}

When the orders are not relatively prime the n-agonal sum can be restricted to:

S = lcm(mi ; i = 0..n-1) (j=0n-1mj - 1) / 2

with all orders relatively prime this reaches its maximum:

Smax = j=0n-1mj (j=0n-1mj - 1) / 2

Special hyperbeams[edit]

The following hyperbeams serve special purposes:

The "normal hyperbeam"[edit]

nNm0,..,mn-1 : [ki] = k=0n-1 ki mkk

This hyperbeam can be seen as the source of all numbers. A procedure called "Dynamic numbering" makes use of the isomorphism of every hyperbeam with this normal, changing the source, changes the hyperbeam. Basic multiplications of normal hyperbeams play a special role with the "Dynamic numbering" of magic hypercubes of order k=0n-1 mk.

The "constant 1"[edit]

n1m0,..,mn-1 : [ki] = 1

The hyperbeam that is usually added to change the here used "analytic" numberrange into the "regular" numberrange. Other constant hyperbeams are of course multiples of this one.

See also[edit]

References[edit]

  1. ^ this is a hyperbeam version of (pe.): Alan Adler magic square multiplication

Further reading[edit]

  • Thomas R. Hagedorn, On the existence of magic n-dimensional rectangles, Discrete Mathematics 207 (1999), 53-63.
  • Thomas R. Hagedorn, Magic retangles revisited, Discrete Mathematics 207 (1999), 65-72.
  • Marián Trenkler, Magic rectangles, The Mathematical Gazette 83(1999), 102-105.
  • Harvey D. Heinz & John R. Hendricks, Magic Square Lexicon: Illustrated, self-published, 2000, ISBN 0-9687985-0-0.

External links[edit]