Professional Documents
Culture Documents
We say:
“I See!”
when we understand
A 0-space cube is a point.
No problem.
Two 3-space cubes with
their corresponding
corners connected form
a 4-space cube.
(a tesseract)
So how do we create
a 5-space cube?
Connect the corresponding corners of two 4-space cubes to form
a 5-space cube.
A messy 5-space cube.
N
Stretching your Intuition
f
b
h
d
e
a h
g
c
b
d So this is also a cube.
This is still a cube.
The physical location of any point is irrelevant.
e
h
c
g
a f
b
It is the connectivity that makes
d
this a 3-space cube.
We pause for a neighborly definition:
Adjacents
b f
d h
These are both 3-space cubes because their connectivity is correct.
In fact, the right-hand cube is just a twisted version of the one
on the left. a
b
e h
a
c g
g
c
b f
d h f d
e
Let’s untwist the
Twisted Circle Cube
a
Pretend the cube is a flat pancake. b
h
Cut the pancake in half along the
dotted line.
e
Let’s untwist the
Twisted Circle Cube
a
Now quarter the pancake. b
e
Flip the G-H quarter over.
g d
h
Let’s untwist the
Twisted Circle Cube
a
Now quarter the pancake. b
e
Flip the G-H quarter over.
h d
g
Things finally get straightened
out.
a
Our Twisted Circle Cube b
is now an e
f
d
h c
g
It is now an
Untwisted Circle Cube
a
b
e e
a
c g
f
d
b f
d h h c
g
N
An Easy Mathematical Approach
Math is a tool
of Infinite Possibilities
Letters are a Cumbersome e m
Naming Convention
y
l
a d
c k x
s
r w ad
j
v
u ac
b i q
h p t ab
g
aa
o
f ae
n z
Every N-cube has 2N points (corners)
N Points in
space each cube
0 1
2 6 0 1
1 2
2 4
3 8
4 16
4 5 5 32
6 64
3 7 7 128
We label the corners using binary numbers
000 001
At first this may seem
to be even more clumsy
than using letters.
010 011
But it gives us one huge
advantage we didn’t have
101 before:
010 011
101
100 10 11
110 111
N=3 N=2
3-digit numbers 2-digit numbers
N
2 N = (8) points 2 = (4) points
Two points are adjacent
if their binary digits differ by only one digit.
00 01
Is adjacent to
00 01
00 10
01 00
01 11
10 00
10 11
11 01
11 10 10 11
A clarifying example: 1101000
1101011
1101101
The adjacents of 1101001 are 1100001
1111001
because each adjacent 1001001
differs from 1101001 by 0101001
one and only one digit.
0 1 0 xor 0=0
0 xor 1=1
1 xor 0=1
0 0 1 1 xor 1=0
1 1 0
XORbitantly Large
N-Space Cubes
000
001
001 000
001
000 000
001 010
001 010 000
001 010
000 000 000
001 010 100
001 010 100 000
011
001 001 001
001 010 100
000 011 101 000
011 101
010 010
001 010
011 000 000
011 101
010 010 010
001 010 100
001 000 110 000
111
101 101 101
001 010 100
101 111 001 000
111
110 110 110
001 010 100
111 100 110 000
111
000
111
0000
1111
1 0000
1 1111
1 Pascal’s
1 1 Triangle
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6 1
1 7 21 35 35 21 7 1
00000
00011 00101 01001 10001 00110 01010 10010 01100 10100 11000
00111 01011 10011 01101 10101 11001 01110 10110 11010 11100
11111
N
Lineset Symmetries
Pretty N-cube
Pictures
0000
1
1 1 1
1 1 1
1111
0000
2
2 2 2
2 2 2
1111
0000
3
3 3 3
3 3 3
1111
0000
4
4 4 4
4 4 4
1111
0000
1 2 3 4
2 31 4 1 3 421 42 3
3 42 421 3 1 4 31 2
1111
n
0
(t+2) = 1 (t+2)
1
(t+2) = T + 2
2 2
(t+2) = T + 4 T + 4
3 3 2
(t+2) = T + 6 T + 12 T + 8
4 4 3 2
(t+2) = T + 8 T + 24 T + 32 T + 16
5 5 4 3 2
(t+2) = T + 10 T + 40 T + 80 T + 80 T + 32
6 6 5 4 3 2
(t+2) = T + 12 T + 60 T + 160 T + 240 T + 192 T + 64
7 7 6 5 4 3 2
(t+2) = T + 14 T + 84 T + 280 T + 560 T + 672 T + 448 T + 128
8 8 7 6 5 4 3 2
(t+2) = T + 16 T + 112 T + 448 T + 1120 T + 1792 T + 1792 T + 1024 T + 256
6 6 5 4 3 2
(T+2) = T + 12T + 60T + 160T + 240T + 192T + 64
00011 00101 01001 10001 00110 01010 10010 01100 10100 11000
00111 01011 10011 01101 10101 11001 01110 10110 11010 11100
11111