| The Hypercube Doubling Theorem | ||
|---|---|---|
|
Given any semi magic latin order m hypercube nLm distributed
over the order 2 hypercube nT2 which after changing digits turns into an "augmentation" magic latin hypercube of order 2m nA2m = nT2(nLm) = mn (D(Fi,j(nLm)) - 1) (i,j = (0,1)) To this augmentation hypercube any order n hypercube can be added to each hyperquadrant such that nH2m = nA2m + Gi,j(nHm) is a regular magic hypercube |
||
|
Distribution functions Fi,j() and Gi,j() |
The distribution functions where in the original method mirroring in the central horizontal and vertical. In order to obtain an order 4 form the order 2 I found Gi,j() need also to include a center mirroring (NEED TO VERIFY) |
|
|
latin hypercube nLm |
Regularly the used hypercube is a zero n-agonal order m hypercube (need checking, possibly more general possibilities!?) |
|
|
Digit changing Di,j() |
Changing digits in the distributed latin hypercube is needed to compensate the off-sums in the obtained order 2m square. Off sums (+c) in one hyperquadrant need to be compensated into an adjecent hyperquadrant by a factor (-c) thus forming the hyperquadrants compenstion patterns (+--+) or (-++-) for squares and (+--+-++-) or (-++-+--+) for cubes. The encyclopedias database lists the data for the order 2 and 3 square and cube, and a derivation method to obtain data for other orders and dimensions as well. |
|
|
Augmentation hypercube nA2m |
Multiplying the above obtained square by mn an augmentation hypercube is obtained to which any order m hypercube can be added, a little care is needed in the choise of the distribution function Gi,j() to avoid doubly appearing numbers |
|