English   Japanese
Home   Site Map   Top   Prev.   Next   3-D ( 1   2   3   4   5 )   4-D ( 1   2   3   4   5   6 )

Algorithms to make pan and strictly magic tesseracts

1. Algorithms for orders divisible by 4

   A pan and strictly magic tesseract, namely, a pan-4-agonal and 2,3,4-agonal magic tesseract, of even order can exist only if the order is divisible by 4 and higher than 7. In this case, if the order is divisible by 16, there exist a Nasik magic tesseract, which satisfies a stronger condition than pan and strictly magic.

1.1 Non-associated pan and strictly magic tesseracts (m = 4x, m >= 8) (also complete)

A pan and strictly magic tesseract aijkh of order m, where i,j,k,h = 0,...,m-1, is given by the following equation (aijkh is also complete):
aijkh = bijkh m3 + bjkhi m2 + bkhij m + bhijk + 1,

where
bijkh = Tm(h) if Bm/2( i mod (m/2), j mod (m/2), k mod (m/2) ) = 0,
m - 1 - Tm(h) if Bm/2( i mod (m/2), j mod (m/2), k mod (m/2) ) = 1,
Tm(x) = x (x < m/2), 3m/2-1-x (otherwise).

Br(u, v, w), where r = m/2, u = i mod (m/2), v = j mod (m/2), and w = k mod (m/2), is an order-r diagonal binary magic cube, that is, a diagonal non-normal magic cube which consists of zeroes and ones. The construction method of Br(u, v, w) is as follows:

(1) Case r = 4x, r >= 4 (m = 8x, m >= 8)

Br(u, v, w), where u, v, w = 0, ..., r-1, is given by
Br(u, v, w) = [(Tr(u) + Tr(v) + Tr(w)) / (r/2)] mod 2.

The following is an example for r = 4 (m = 8):

B4(u, v, w)

w = 0
0011
0101
1010
1100
w = 1
0101
1100
0011
1010
w = 2
1010
0011
1100
0101
w = 3
1100
1010
0101
0011


(2) Case r = 4x+2, r >= 6 (m = 8x+4, m >= 12)

Br(u, v, w), where u, v, w = 0, ..., r-1, is given by
Br(u, v, w) = Br*(u, v, w) xor Dr(u, v, w),

where
Br*(u, v, w) = V(Cr/2(u*, v*, w*)) xor [u/(r/2)] xor [v/(r/2)] xor [w/(r/2)],
Cr/2(u*, v*, w*) = (u* + v* - 2w*) mod (r/2),
V(x) = x mod 2 (if x <= 1),   (x+1) mod 2 (if x >= 2),
Dr(u, v, w) = 0 or 1 (the condition is defined later),

where
u* = min{ u, r-1-u }, v* = min{ v, r-1-v }, w* = min{ w, r-1-w }.

Dr(u, v, w) is a function to adjust the diagonals of Br*(u, v, w).
Dr(u, v, w) = 1 if u, v, and w satisfy one of the following conditions:

The following is an example for r = 6 (m = 12):

C3(u*, v*, w*)
w* = 0
012
120
201
w* = 1
120
201
012
w* = 2
012
120
201
V(C3(u*, v*, w*))
w* = 0
011
110
101
w* = 1
110
101
011
w* = 2
101
011
110
B6*(u, v, w)
w = 0 (w* = 0)
011001
110100
101010
010101
001011
100110
w = 1 (w* = 1)
110100
101010
011001
100110
010101
001011
w = 2 (w* = 2)
101010
011001
110100
001011
100110
010101

w = 3 (w* = 2)
010101
100110
001011
110100
011001
101010
w = 4 (w* = 1)
001011
010101
100110
011001
101010
110100
w = 5 (w* = 0)
100110
001011
010101
101010
110100
011001
D6(u, v, w)
w = 0 (w* = 0)
010010
000101
000000
000000
010111
000000
w = 1 (w* = 1)
000000
001100
000011
001111
000000
000000
w = 2 (w* = 2)
000110
000000
100001
000000
000000
100111

w = 3 (w* = 2)
000110
000000
100001
000000
000000
100111
w = 4 (w* = 1)
000000
001100
000011
001111
000000
000000
w = 5 (w* = 0)
010010
000101
000000
000000
010111
000000
B6(u, v, w)
w = 0
001011
110001
101010
010101
011100
100110
w = 1
110100
100110
011010
101001
010101
001011
w = 2
101100
011001
010101
001011
100110
110010

w = 3
010011
100110
101010
110100
011001
001101
w = 4
001011
011001
100101
010110
101010
110100
w = 5
110100
001110
010101
101010
100011
011001

Back


Home   Site Map   Top   Prev.   Next   3-D ( 1   2   3   4   5 )   4-D ( 1   2   3   4   5   6 )

Mitsutoshi Nakamura (Feedback)    To send an email to me, please enable JavaScript on your browser.
[Legal indication] Prohibit the send of any spam or advertising.

This page was last updated on August 8, 2016.
"Magic Cubes and Tesseracts"   http://magcube.la.coocan.jp/magcube/en/
Copyright © 2004-2016, Mitsutoshi Nakamura. All rights reserved.

track feed Magic Cubes and Tesseracts RSS
SEO
loading
Magic Cubes and Tesseracts