Fact-checked by Grok 2 weeks ago

5-cube

A 5-cube, also known as a penteract, is a five-dimensional analog of the three-dimensional and a type of in . It consists of 32 vertices, 80 edges, 80 square faces, 40 cubic cells, and 10 facets, with each vertex incident to five edges and five tesseracts. The structure can be defined by coordinates where each vertex is a point in \mathbb{R}^5 with components \pm 1/2 in each dimension, ensuring all edges have unit length when appropriately scaled. As a member of the family, the 5-cube generalizes lower-dimensional cubes through recursive construction: it can be viewed as two mutually orthogonal 4-dimensional tesseracts joined at their boundaries or as the of its vertices. Its is \{4,3,3,3\}, indicating a with square facets meeting three at a time around each edge, and so on up to the five-dimensional level. The dual of the 5-cube is the five-dimensional , or 5-orthoplex, which has the same but interchanges vertices and facets. Visualizing the 5-cube requires projections into lower dimensions, such as isometric views into , which reveal its intricate network of interconnected lower-dimensional elements; one such projection appears in H.S.M. Coxeter's foundational work on regular polytopes. In applications, 5-cubes appear in for modeling high-dimensional data structures, like networks with 32 nodes for , leveraging their high connectivity and symmetry. The 5-dimensional of a unit 5-cube (with edge length 1) is 1.

Definition

Basic Description

The 5-cube is a 5-polytope that belongs to the family of , which generalize the square and to higher dimensions. As such, it represents the five-dimensional counterpart to the square (2-cube), (3-cube), and (4-cube), extending the pattern of orthogonal projections and Cartesian products into five-dimensional . This polytope exhibits the defining properties of regularity, being convex with all facets congruent regular polytopes and all vertices equivalent under its . Consequently, it is isogonal, meaning its vertices are transitive under the symmetry operations, and isohedral, with faces that are equivalently positioned and oriented. Common naming conventions for the 5-cube include "penteract," a portmanteau derived from the Greek word for five and the term , as well as "pent" as an abbreviation and "decateron," reflecting its structure with ten facets. As a , it holds a foundational position among the uniform 5-polytopes, which encompass vertex-transitive figures constructed from regular or uniform lower-dimensional elements.

Schläfli Symbol

The Schläfli symbol of the 5-cube is {4,3,3,3}, which recursively describes its structure as a regular 5-polytope: the symbol begins with {4} indicating square 2-faces, followed by three 3's specifying that three squares meet at each edge, three cubes {4,3} meet at each square face (forming the cubic 3-faces), and three tesseracts {4,3,3} meet at each cubic cell (forming the tesseractic 4-faces). This notation, introduced by Ludwig Schläfli in the 19th century and systematized by H.S.M. Coxeter, encodes the uniformity and recursive buildup of the polytope from lower-dimensional elements, where each level's integer indicates the number of such elements incident to the previous level's feature. The symbol {4,3,3,3} confirms the 5-cube's regularity, as it satisfies Schläfli's criteria for convex regular polytopes in five dimensions—specifically, the sequence produces a finite, irreducible with all branch numbers ≤4 and satisfying the determinant condition for of the —ensuring equal edge lengths, equal angles, and transitive symmetry on elements of each type. Coxeter proved that such symbols for extend indefinitely in higher dimensions without violating convexity, distinguishing them as one of three infinite families of regular polytopes beyond the Platonic solids. This Schläfli symbol corresponds to the Coxeter-Dynkin diagram of type B_5, a linear chain of five nodes connected by single bonds (labeled 3, dihedral angles of \pi/3) except for a double bond (labeled 4, dihedral angle of \pi/4) between the first and second nodes, which generates the full symmetry group via reflections in five mutually perpendicular hyperplanes; the diagram's structure directly implies the hypercubic tiling's regularity in Euclidean 5-space. The 5-cube can be constructed as the of its 32 vertices, equivalently realized through the of five line segments or as the measure in . Alternatively, within the B_5 , it arises via processes applied to the fundamental chamber, such as full truncation yielding the bitruncated 5-orthoplex (its ) or processes that preserve regularity from the simplex-generated family, though the itself is the "parent" form in this lineage.

Combinatorial Structure

Element Counts

The 5-cube, or penteract, is a 5-dimensional whose facial elements follow the standard enumeration for . The number of k-dimensional elements, or k-faces, in an n-cube is given by the formula f_k = 2^{n-k} \binom{n}{k}, where \binom{n}{k} is the . For n=5, this formula specializes as follows: there are f_0 = 32 vertices (0-faces), f_1 = 80 edges (1-faces), f_2 = 80 square faces (2-faces), f_3 = 40 cubic cells (3-faces), and f_4 = 10 cells (4-faces). This combinatorial uniformity arises from the 5-cube's recursive , where each corresponds to choosing k varying coordinates out of 5 and fixing the positions in the remaining n-k coordinates across 2 choices each. Consequently, the ensures that each connects to 5 edges, as the has degree n=5. Each edge lies in 4 square faces (by selecting one additional varying direction from the remaining 4), each square face bounds 3 cubic s (selecting one more from the remaining 3 directions), and each cubic cell is bounded by 2 tesseracts (the final choice of the last direction). The complete set of facial elements is summarized in the following table:
kElement TypeNumber
032
1Edges80
2Squares80
3Cubic cells40
410

Incidence Relations

In the 5-cube, incidence relations describe the connectivity between its elements of different dimensions, specifically how lower-dimensional faces are contained within higher-dimensional ones. Each (0-face) is incident to 5 edges (1-faces), each edge to 4 square faces (2-faces), each square to 3 cubic cells (3-faces), and each cubic cell to 2 cells (4-faces). More generally, in an n-dimensional such as the 5-cube (n=5), each k-face is contained in exactly (n - k) distinct (k+1)-faces. This follows from the structure of the , where a k-face is represented by a ternary string with exactly k free coordinates (marked as varying) and (n - k) fixed coordinates (set to 0 or 1); extending to a (k+1)-face requires selecting one of the (n - k) fixed coordinates to make varying, yielding precisely (n - k) such extensions. For the 5-cube, this yields the specific incidences noted above: 5 for k=0, 4 for k=1, 3 for k=2, and 2 for k=3. Conversely, each (k+1)-face in the 5-cube contains exactly 2(k+1) k-faces, as a (k+1)-face (itself a (k+1)-) has 2(k+1) choices for fixing one of its (k+1) varying coordinates to either 0 or 1. Thus, each square (k=1) contains 4 edges, each (k=2) contains 6 squares, each (k=3) contains 8 cubes, and the full 5-cube (k=4) contains 10 . These relations hold uniformly across the 10 that bound the 5-cube. The following table summarizes key incidence numbers for the 5-cube, focusing on the number of j-faces containing each i-face (for i < j), derived from the general formulas where the number is \binom{n-i}{j-i}.
i-facej=1 (edges)j=2 (squares)j=3 (cubes)j=4 (tesseracts)
(0)510105
(1)-464
square (2)--33
(3)---2
These incidences verify the of the 5-cube's boundary, which is topologically an S^4 and thus equals 2: V - E + F_2 - F_3 + F_4 = 32 - 80 + 80 - 40 + 10 = 2, where the element counts are as previously detailed.

Geometry

Cartesian Coordinates

The 5-cube is embedded in 5-dimensional with its vertices at all possible combinations of coordinates ( \pm 1, \pm 1, \pm 1, \pm 1, \pm 1 ), centered at the , yielding vertices as per its combinatorial structure. Adjacent vertices differ in exactly one coordinate, so the edge length is the \sqrt{(2)^2} = 2. To achieve unit edge length, the coordinates are scaled by a factor of $1/2, resulting in vertices at all combinations of ( \pm 1/2, \pm 1/2, \pm 1/2, \pm 1/2, \pm 1/2 ). For this unit-edge scaling, the circumradius—the distance from the origin to any vertex—is \sqrt{5 \cdot (1/2)^2} = \sqrt{5}/2 \approx 1.118. This coordinate representation arises from the 5-cube as the of five identical intervals [-1, 1]^5, with vertices at the product of the endpoints.

Metric Properties

The 5-cube, or penteract, possesses several key metric properties derived from its uniform edge length a. Its 5-dimensional volume, representing the content enclosed by the , is given by V = a^5. For example, when a = 1, the volume is 1. This formula arises from the structure of the , where each dimension contributes a of a to the measure. The hypersurface area, or the total 4-dimensional content of the boundary consisting of 10 facets, is S = 10 a^4. This measure quantifies the "surface" enclosing the 5-volume and equals $2 \times 5 \times a^4, reflecting two parallel 4-faces per times the 4-volume of each facet. For a = 1, S = 10. The 5-cube is a tangential , admitting an inscribed hypersphere tangent to all facets with inradius r = \frac{a}{2}, derived from the general relation for such polytopes V = \frac{1}{5} r S. This inradius remains independent of for hypercubes, as the distance from to any facet is \frac{a}{2}. The diameter, the maximum between any two vertices, occurs between antipodal vertices differing in all five coordinates and equals a \sqrt{5}. This establishes the scale of the polytope's extent along its space diagonal. Additionally, the 5-cube possesses a midsphere tangent to all edges at their midpoints, a property shared by hypercubes as tangential polytopes. The following table summarizes these measures for edge lengths a = 1 and a = 2, computed using the vertex coordinates aligned with the axes from -\frac{a}{2} to \frac{a}{2} in each :
Measurea = 1a = 2
V132
Hypersurface area S10160
Inradius r0.51
d\sqrt{5} \approx 2.236$2\sqrt{5} \approx 4.472

Symmetry

Full Symmetry Group

The full symmetry group of the 5-cube is the hyperoctahedral group B_5, which is isomorphic to the of type B_5. This group has order $5! \times 2^5 = 120 \times 32 = 3840. The group B_5 is generated by the permutations of the five coordinates together with sign flips on each coordinate, corresponding to signed permutations of five elements. As a , it admits a via the Coxeter for type B_5, which consists of five nodes arranged in a linear chain with single edges connecting the first four nodes and a double edge connecting the fourth and fifth nodes. The rotational symmetries form an index-2 of B_5, with $2^{4} \times 5! = 16 \times 120 = 1920. The group acts transitively on the 32 vertices of the 5-cube. By the orbit- theorem, the stabilizer of any vertex therefore has $3840 / 32 = 120.

Prismatic Subgroups

The prismatic subgroups of the 5-cube arise from its decompositions as Cartesian products of lower-dimensional s, reflecting reduced symmetries when edge lengths are equalized within groups of coordinate directions but differ between groups. These decompositions correspond to the seven integer s of 5, each defining a distinct prismatic form with a symmetry group consisting of the hyperoctahedral groups B_k (Weyl groups of type B_k/C_k) for each part k in the partition. The full of the 5-cube is B_5, of order $2^5 \cdot 5! = 3840, acting as signed permutations on the five coordinates. The prismatic subgroups are proper subgroups preserving these product structures. For the partition (5), the form is the full 5-cube itself, with symmetry B_5 of order 3840. The partition (4,1) yields the tesseractic prism (4-cube × interval), with symmetry B_4 \times B_1 of order (2^4 \cdot 4!) \cdot 2 = 768. The partition (3,2) corresponds to the cube-square duoprism (3-cube × 2-cube), with symmetry B_3 \times B_2 of order (2^3 \cdot 3!) \cdot (2^2 \cdot 2!) = 384. The partition (3,1,1) gives a cube-rectangle duoprism (3-cube × interval × interval), with symmetry B_3 \times B_1 \times B_1 of order $48 \cdot 2 \cdot 2 = 192. The partition (2,2,1) produces a square-square duoprism prism (2-cube × 2-cube × interval), with symmetry B_2 \times B_2 \times B_1 of order $8 \cdot 8 \cdot 2 = 128. The partition (2,1,1,1) forms a square-rectangular duoprism (2-cube × interval³), with symmetry B_2 \times B_1^3 of order $8 \cdot 2^3 = 64. Finally, the partition (1,1,1,1,1) is the 5-orthotope, with symmetry B_1^5 of order $2^5 = 32. The following table summarizes these seven prismatic forms, their decompositions, symmetry groups, and orders:
PartitionPrismatic FormDecompositionSymmetry GroupOrder
(5)5-cubeB_53840
(4,1)Tesseractic 4-cube × intervalB_4 \times B_1768
(3,2)Cube-square 3-cube × 2-cubeB_3 \times B_2384
(3,1,1)Cube-rectangle 3-cube × interval × intervalB_3 \times B_1^2192
(2,2,1)Square-square prism2-cube × 2-cube × intervalB_2^2 \times B_1128
(2,1,1,1)Square-rectangular 2-cube × interval³B_2 \times B_1^364
(1^5)5-orthotopeinterval⁵B_1^532
These prismatic subgroups enable geometric realizations of the 5-cube where the combinatorial is preserved but anisotropies reduce the , facilitating compounds and layered constructions in higher-dimensional geometry. For instance, the tesseractic realizes the 5-cube with 10 tesseracts as facets under B_4 \times B_1 , while the cube-square uses 40 cubes as cells under B_3 \times B_2. The count remains $3840 across all forms, as it is a combinatorial , but the subgroups vary inversely with the group orders, affecting on flags.

Representations

Configuration Model

The configuration model of the 5-cube describes its abstract combinatorial structure through the incidence relations between its elements, independent of any geometric embedding. This model captures how lower-dimensional elements are contained within higher-dimensional ones, providing a complete specification of the as a (poset) under inclusion. The face poset of the 5-cube is ranked by dimension, with ranks corresponding to 0-faces (vertices) up to 4-faces (tesseracts), and the whole polytope as the unique 5-face. The structure is regular, meaning every k-face is combinatorially equivalent, and incidences follow a uniform pattern derived from the hypercube's construction as the of five line segments. These numbers arise from the general for incidences in an n-: the number of k-faces containing a fixed m-face (m < k) is \binom{n-m}{k-m}, reflecting choices of additional varying directions from the fixed ones in the m-face. For n=5, this yields the consecutive up-degrees 5 ( per ), 4 (squares per ), 3 ( per square), and 2 ( per ), with the down-degrees complementing as 2 ( per ), 4 ( per square), 6 (squares per ), 8 ( per ), and 10 ( per 5-cube). The full configuration can be represented by an for consecutive dimensions, where rows and columns correspond to the types of (0- to 4-faces), the diagonal entries are the element counts, and off-diagonal entries give the uniform incidence degrees between adjacent ranks. This encodes the local structure and allows computation of global properties like the total number of flags (complete chains of faces from to facet).
Element TypeVertices (0)Edges (1)Squares (2)Cubes (3)Tesseracts (4)
Vertices (0)325---
Edges (1)2804--
Squares (2)-4803-
Cubes (3)--6402
Tesseracts (4)---810
Here, symmetric entries (e.g., 4 for edges-to-squares up and down) highlight the self-duality of the 5-cube. The off-diagonal values confirm the regularity: each row sum for k (excluding diagonal) equals the degree to the next , and column sums reflect the reverse. This matrix distinguishes the 5-cube from other 5-polytopes, such as the , whose incidences follow simplicial patterns (all degrees n-k=4 for up from k). The set of 32 elements forms the Q_5, a with no complete K_{32} connectivity, but the full incidence poset extends this to a higher-dimensional where elements correspond to partial coordinate fixings in {0,1}^5. This poset is isomorphic to the distributive lattice \prod_{i=1}^5 D_i, where each D_i is the diamond poset (two minimal elements covered by a maximal element, modeling fixed-0, fixed-1, and varying for each dimension). Unlike the boolean lattice B_5 (which has \binom{5}{k} elements per ), the 5-cube's poset has \binom{5}{k} 2^{5-k} per k, emphasizing the dual roles of choice and fixing. This relates to higher incidence geometries via its chamber system, governed by the B_5, and to s: for instance, the graph on edges (rank 1 elements) is the of Q_5, with vertices adjacent if sharing a vertex, while higher ranks yield iterated s capturing shared lower faces. Such relations underpin applications in and , where the 5-cube models error-correcting codes over F_2^5.

Projections

The orthogonal projection of a 5-cube onto a 4-dimensional preserves its 10 cells, allowing the structure to be viewed as a collection of these 4-dimensional facets without collapse, though the overall metric is distorted based on the choice of . This projection is useful for analyzing the incidence relations among the cells, as the tesseracts remain intact as bounded regions in the 4D space. For projection to 3 dimensions, an orthogonal projection of the unit 5-cube yields a rhombic as its convex envelope, with 22 exterior vertices and 10 interior vertices corresponding to the 32 vertices of the original . The 40 cubic cells project to golden rhombohedra that tile the interior of this envelope. To achieve a symmetric form, the projection basis incorporates the \phi = \frac{1 + \sqrt{5}}{2}, with example vertex coordinates derived from linear combinations such as those involving \phi and $1/\phi = \phi - 1, ensuring the envelope's 20 golden rhombic faces align with the polytope's symmetry. In 2 dimensions, the Coxeter plane projection of the 5-cube, perpendicular to a principal of its , reveals a decagonal of order 10, the Coxeter number for the B_5 . Of the 32 vertices, two project to the origin, while the remaining 30 lie on three concentric circles, each with 10 evenly spaced points, highlighting nested tesseracts and the envelope's outline formed by the outermost edges. General orthogonal projections to lower dimensions can be formulated by selecting an for the target space and computing the dot products of the 5-cube's vertices with these basis vectors. For a \mathbf{v} = (v_1, v_2, v_3, v_4, v_5) \in \{-1/2, 1/2\}^5 (scaled for unit length), the projected coordinates in k \leq 4 dimensions are \mathbf{p} = \sum_{i=1}^k (\mathbf{v} \cdot \mathbf{u}_i) \mathbf{e}_i, where \{\mathbf{u}_i\} are the unit basis vectors in \mathbb{R}^5 spanning the and \{\mathbf{e}_i\} form the in \mathbb{R}^k. Alternative stereographic projections, which map the 5-cube from a hypersphere in \mathbb{R}^5 to \mathbb{R}^3, use iterative formulas like x_j = \frac{4X_j}{\theta_2^4 + 1} for j=1,2,3, with quadratic forms \theta_2^m = \sum (r_m X_i)^2 + \cdots adjusted by radii r_3, r_4 to control distortion and preserve topological features. These projections introduce distortions where edge lengths vary systematically; central edges, closer to the projection center, appear shorter than peripheral ones due to the compressive effects of dimensionality reduction, with the degree depending on the subspace orientation.

Dual Polytope

The dual of the 5-cube is the 5-orthoplex, also known as the 5-cross-polytope, a regular convex 5-polytope whose facets are 4-simplices. This duality reverses the face lattice of the 5-cube, such that the 5-orthoplex has 10 vertices (corresponding to the 10 4-faces of the 5-cube), 40 edges (to the 40 3-faces), 80 triangular 2-faces (to the 80 square 2-faces), 80 tetrahedral 3-faces (to the 80 edges), and 32 4-faces (to the 32 vertices). The Schläfli symbol of the 5-orthoplex is \{3,3,3,4\}, the reciprocal of the 5-cube's \{4,3,3,3\}. The vertices of the 5-orthoplex, centered at the , are the 10 points in \mathbb{R}^5 consisting of \pm 1 in one coordinate and 0 in the others, i.e., the vectors and their negatives. This coordinate representation highlights its role as the of the vectors and their negatives, contrasting with the 5-cube's vertices at all sign combinations of ( \pm 1, \pm 1, \pm 1, \pm 1, \pm 1 ) / \sqrt{5} in a unit-normalized form. Both polytopes share the full given by the B_5, the hyperoctahedral group of order $2^5 \cdot 5! = 3840, which acts by signed permutations on the coordinates. However, the realizations differ topologically: for example, sections of the 5-orthoplex through certain hyperplanes yield triangular 2-faces, reflecting its simplicial nature, in contrast to the quadrilateral sections of the 5-cube. In the polar duality with respect to the Euclidean unit ball, where the 5-cube is taken as the \ell_\infty-ball [-1,1]^5, the dual 5-orthoplex is the \ell_1-ball \{ x \in \mathbb{R}^5 : \sum_{i=1}^5 |x_i| \leq 1 \}, and their volumes satisfy a reciprocal scaling relation governed by the dimension, with the product V(P) V(P^*) bounded below by that of the unit ball.

Dimensional Analogues

The 5-cube, or penteract, is part of the broader family of hypercubes, which generalize the cube to higher dimensions. Its lower-dimensional analogues illustrate the progressive build-up of structure: the 1-cube is a line segment with 2 vertices; the 2-cube is a square with 4 vertices and 4 edges; the 3-cube is a cube with 8 vertices, 12 edges, and 6 square faces; and the 4-cube, or tesseract, has 16 vertices, 32 edges, 24 square faces, and 8 cubic cells. These examples demonstrate how each successive dimension doubles the number of vertices while introducing new types of bounding elements. A key pattern in hypercubes is captured by the formula for the number of k-dimensional elements (or k-faces) in an n-cube: f_k(n) = 2^{n-k} \binom{n}{k}, where \binom{n}{k} is the . This expression accounts for the combinatorial choices of directions for the faces and the binary states (present or absent) along the remaining dimensions, enabling computation of all structural components from vertices (k=0) to the full n-cube itself (k=n). In higher dimensions, the extends this pattern with 64 vertices, 192 edges, 240 square faces, 160 cubic cells, 60 tesseracts, and 12 penteracts, showcasing in . As the dimension n increases further, the 's connectivity rises linearly with n (each connects to n others), while the total number of elements grows factorially modulated by powers of 2, leading to immense structural intricacy. In the infinite-dimensional limit, the corresponds to the unit ball in the \ell^\infty on sequence spaces, where phenomena like concentration of measure dominate: most of the "volume" concentrates near the boundary, and functions exhibit strong deviation bounds.

References

  1. [1]
    Hypercube -- from Wolfram MathWorld
    The hypercube is a generalization of a 3-cube to n dimensions, also called an n -cube or measure polytope. It is a regular polytope with mutually perpendicular ...
  2. [2]
    5-cube - EPFL Graph Search
    In five-dimensional geometry, a 5-cube is a name for a five-dimensional hypercube with 32 vertices, 80 edges, 80 square faces, 40 cubic cells, and 10 ...
  3. [3]
    Schläfli Symbol -- from Wolfram MathWorld
    A symbol of the form {p,q,r,...} used to describe regular polygons, polyhedra, and their higher-dimensional counterparts.
  4. [4]
    Coxeter-Dynkin Diagram -- from Wolfram MathWorld
    Coxeter-Dynkin diagrams are used to visualize Coxeter groups. A Coxeter-Dynkin diagram is associated with each rational double point (Fischer 1986), and a ...Missing: B5 hypercube<|control11|><|separator|>
  5. [5]
    Counting the Faces of Higher-Dimensional Cubes - Brown Math
    But in this count, each k-cube is counted 2k times, so we divide by that number to get the final formula: Q(k, n) = 2n-kC(k, n) . An inspection of the table ...
  6. [6]
    [PDF] Hypercube Graphs and the Representation Theory of Symmetric ...
    Apr 29, 2023 · For an n-cube graph, each vertex is adjacent to n other vertices. The number of vertices adjacent to a given vertex v is called the degree of v.
  7. [7]
    Hypercube (Technical Notes) - Greg Egan
    Apr 22, 2007 · There are two features of an n-dimensional hypercube that can be counted immediately. Since the vertices all take the form (±1,±1,...±1), it's ...
  8. [8]
    Cubes in all Dimensions - Frank Sottile
    Apr 23, 2022 · hyperCube. Cubes in all Dimensions. Frank Sottile. Cubes ... The cube in dimension d is simply the Cartesian product of d intervals, [0,1]d.<|control11|><|separator|>
  9. [9]
    Surface Area of a Hypercube - Math Stack Exchange
    Jul 12, 2013 · For example, V=1n∑r⋅dS, integrated over the full surface. A nice trick to go from n-dimensional volume to (n−1)-dimensional whatever is to ...volume of a cube and a ball in n-dimensions? - Math Stack Exchangeintersection of hypercube and hypersphere - Math Stack ExchangeMore results from math.stackexchange.comMissing: inradius | Show results with:inradius
  10. [10]
    Why is inradius $\times$ surface area equal to thrice the volume?
    Jul 23, 2016 · "Inradius" means radius of largest sphere that is tangent to all faces. For example: Cube - Surface area =6a2, Inradius =a/2, Volume =a3.
  11. [11]
    Finding the diameter of a n-cube - Math Stack Exchange
    Finding the diameter of a n-cube · Ask Question. Asked 11 years, 8 months ago. Modified 11 years, 8 months ago. Viewed 7k times. This question shows ...<|control11|><|separator|>
  12. [12]
    [PDF] arXiv:2206.08925v2 [math.CO] 28 May 2023
    May 28, 2023 · The group is isomorphic to the Weyl group of type B ... The hyperoctahedral group Bn is the symmetry group of the n-dimensional hypercube.
  13. [13]
    Attractors with the Symmetry of the n-Cube - Project Euclid
    This yields a group of order 2nn!. The orientation-preserving symmetry group is half the size of the full group; it is generated by n 1 rotations as follows.
  14. [14]
    [PDF] Character formulas and descents for the hyperoctahedral group - arXiv
    Jan 24, 2017 · The hyperoctahedral group Bn consists of all signed permutations of length n, meaning bijective maps w : Ωn → Ωn such that w(a) = b ⇒ w(¯a)= ...Missing: diagram | Show results with:diagram
  15. [15]
    [PDF] Symmetry Parameters of Various Hypercube Families - arXiv
    Oct 8, 2021 · In this paper, we focus on the symmetry of these graphs. The hypercube Qn has vertex set V (Qn) = Zn. 2 = {v = v1 ...vn | vi ∈ {0, 1}}, with ...
  16. [16]
    hypercube in nLab
    Jan 27, 2025 · The symmetry group of the n n -dimensional hypercube is the wreath product C 2 ≀ Sym ( n ) C_2 \wr Sym(n) of the cyclic group of order 2 ...
  17. [17]
    Symmetry group of product polytope - Mathematics Stack Exchange
    Sep 19, 2015 · The symmetry group of the interval [−1,1] is Z2, since it consists only of the identity and the reflection at the origin.Product of two polytopes is a polytope - Math Stack ExchangeCan all groups be thought of as the symmetries of a geometrical ...More results from math.stackexchange.comMissing: cartesian | Show results with:cartesian
  18. [18]
  19. [19]
    Mathematics behind QuasiTiler by M. Senechal - The Geometry Center
    The projection of the unit 5-cube into 3-dimensional space is a rhombic icosahedron, which we will call K. The surface S is then determined by all the ...
  20. [20]
    Coxeter elements and Coxeter plane: A programming guide
    The image shows the projection of the vertices and edges of a 5-dimensional hypercube onto its Coxeter plane. The root system of the Lie algebra consists of 240 ...
  21. [21]
  22. [22]
    [PDF] Unfolding the Simplex and Orthoplex - Satyan Devadoss
    2 The orthoplex is dual to the cube and is sometimes called the cross-polytope or the cocube. 38th European Workshop on Computational Geometry, Perugia ...
  23. [23]
    regular polytopes : h.s.m coxeter - Internet Archive
    Aug 17, 2022 · regular polytopes · Share or Embed This Item · Flag this item for · regular polytopes · DOWNLOAD OPTIONS · IN COLLECTIONS · SIMILAR ITEMS (based ...
  24. [24]
    [PDF] On the volume of projections of the cross-polytope - arXiv
    Apr 7, 2020 · The cross-polytope is the dual (polar) body for the standard cube n = [−1, 1]n. In this paper we study lower and upper bounds on the volume of.
  25. [25]
    254A, Notes 1: Concentration of measure - Terry Tao - WordPress.com
    Jan 3, 2010 · A remarkable phenomenon, known as concentration of measure, asserts that assuming a sufficient amount of independence between the component variables {X_1,\ ...