notes and information about n-cubes that i could not find summarized in other places.
an n-cube, also known as a hypercube, is a geometric figure in n-dimensional space, characterized by being composed of points whose coordinates are constrained within a unit interval [0,1]. each edge of the n-cube is orthogonal (perpendicular) to every other edge, extending in mutually orthogonal directions.
conventions for this section:
n-cell: "2 ** n"
in this example, we filter the vertices of each sub-cell. it would be possible to generate the vertices separately.
for "k" from 1 to "n - 1"
for each possible k-combination of component indices
for each n-bit sequence of the selected indices
combine with each n-bit sequence of the remaining indices
the following templates are the basis for the 2-cube faces of a 4-cube. components at "f" are fixed for each face and all variations of "v" (either 0 or 1) create its vertices.
ffvv fvfv fvvf vffv vfvf vvff
the four vertices of one square side of a 4-cube with the pattern vfvf and fixed values v0v1:
0001 0011 1001 1011
3-cube
4-cube
cell counts
4-cube
3-cube
2-cube
0-cells: 4 vertices
1-cells: 4 edges
2-cell: 1
adjacent cell counts
3-cube
4-cube
each vertex has 4 edges
each edge has 3 faces