![]() In one column is three times the sum of the entries in the Left of it plus the entry above that one, so the sum of entries That each entry is the sum of twice the entry directly to the There are several ways to verify this observation. Īn inspection of the table reveals that the entries in each column add But in this count, each k-cube is counted 2 k times, so we divide by that number to get the final formula: Q( k, n) = 2 n- k C( k, n). Since we have C( k, n) k-cubes at each of the 2 n vertices, we obtain a total number 2 n C( k, n). Therefore the number of k-cubes at each vertex of an n-cube is C( k, n) = n!/, the combinations of n things taken k at a time. There are n edges emdnating from each vertex, and we get a k-cube for any subset of k distinct edges from among these n edges. To calculate Q( k, n) we may first find out how many k-cubes there are at each vertex. Let Q( k, n) denote the number of k-cubes in an n-cube. It is possible to express these results in a general formula. The correct number of squares in a hypercube is then 96/4, or 24. Since there are 16 vertices, we can multiply 6 by 16 to get 96, but this counts each square four times, once for each of its vertices. At each vertex there are as many square faces as there are ways to choose 2 edges from among the 4 edges at the point, namely 6. If we know what happens at one vertex, we can figure out what is going to happen at all vertices. The hypercube is so highly symmetric that every vertex looks like every other vertex. The analysis of symmetry groups has provided extremely significant tools in modern geometry and in the applications of geometry to molecular chemistry and quantum physics. The collection of symmetries is one of the most important examples of an algebraic structure known as a group. The even larger group of symmetries of the cube enables us to move any vertex to any other vertex and any edge and square at that vertex to a chosen edge and square at the new vertex. A square has a much larger number of symmetries: we can rotate the square into itself by one, two, or three quarter-turns about its center, and we can reflect the square across either of its diagonals, or across the horizontal or vertical lines through its center. A segment possesses one symmetry, obtained by interchanging its endpoints. This manner of grouping the faces of an object is particularly effective when the object possesses a great deal of symmetry, as does the hypercube. Left: Two groups of four parallel square faces in a Relatively more difficult when the overlap is large. Note that it isĮasier to identify the 4 squares when they do not overlap and The entire set of 24 squares in the hypercube. To identify the remaining three groups of 4 squares to obtain Illustration on the bottom, left, shows two groups of 4 parallel Similarly the squares can be considered as six groups ofĤ parallel squares, one such square through each vertex. The edges in the hypercube come in four groups of 8 parallelĮdges. There are 6 squares on the red cube and 6 on the blue one, and we also find 12 squares traced out by the edges of the moving cube for a total of 24. We have 12 edges on the red cube, 12 on the blue, and now 8 new edges for a total of 32 edges on the hypercube.įinding the number of square faces on the hypercube presents more of a problem, but a version of the same method can solve it. As the red cube moves toward the blue cube, the 8 vertices trace out 8 parallel edges. We draw the first cube in red and the second in blue. We can show what is happening schematically by drawing two cubes, one obtained by displacement from the other. We know that we can generate a hypercube by taking an ordinary cube and moving it in a direction perpendicular to itself. When we try to fill in the missing numbers for a hypercube, the process becomes a bit more difficult. Moving a cube perpendicular to itself creates a hypercube. ![]() Counting the Faces of Higher-Dimensional Cubes Counting the Faces of Higher-Dimensional CubesĪnalogous to the sequence of simplexes in each dimension, we have a
0 Comments
Leave a Reply. |