#jsDisabledContent { display:none; } My Account |  Register |  Help

# 7-cube

Article Id: WHEBN0010275954
Reproduction Date:

 Title: 7-cube Author: World Heritage Encyclopedia Language: English Subject: Collection: Publisher: World Heritage Encyclopedia Publication Date:

### 7-cube

7-cube
Hepteract

Orthogonal projection
inside Petrie polygon
The central orange vertex is doubled
Type Regular 7-polytope
Family hypercube
Schläfli symbol {4,35}
Coxeter-Dynkin diagram
6-faces 14 {4,34}
5-faces 84 {4,33}
4-faces 280 {4,3,3}
Cells 560 {4,3}
Faces 672 {4}
Edges 448
Vertices 128
Vertex figure 6-simplex
Coxeter group C7, [35,4]
Dual 7-orthoplex
Properties convex

In geometry, a 7-cube is a seven-dimensional hypercube with 128 vertices, 448 edges, 672 square faces, 560 cubic cells, 280 tesseract 4-faces, 84 penteract 5-faces, and 14 hexeract 6-faces.

It can be named by its Schläfli symbol {4,35}, being composed of 3 6-cubes around each 5-face. It can be called a hepteract, a portmanteau of tesseract (the 4-cube) and hepta for seven (dimensions) in Greek. It can also be called a regular tetradeca-7-tope or tetradecaexon, being a 7 dimensional polytope constructed from 14 regular facets.

## Related polytopes

It is a part of an infinite family of polytopes, called hypercubes. The dual of a 7-cube is called a 7-orthoplex, and is a part of the infinite family of cross-polytopes.

Applying an alternation operation, deleting alternating vertices of the hepteract, creates another uniform polytope, called a demihepteract, (part of an infinite family called demihypercubes), which has 14 demihexeractic and 64 6-simplex 6-faces.

## Cartesian coordinates

Cartesian coordinates for the vertices of a hepteract centered at the origin and edge length 2 are

(±1,±1,±1,±1,±1,±1,±1)

while the interior of the same consists of all points (x0, x1, x2, x3, x4, x5, x6) with -1 < xi < 1.

## Projections

 This hypercube graph is an orthogonal projection. This orientation shows columns of vertices positioned a vertex-edge-vertex distance from one vertex on the left to one vertex on the right, and edges attaching adjacent columns of vertices. The number of vertices in each column represents rows in Pascal's triangle, being 1:7:21:35:35:21:7:1. Petrie polygon, skew orthographic projection Another orthogonal projection

Hepteract 7D simple rotation through 2Pi with 7D perspective projection to 3D.

## References

• H.S.M. Coxeter:
• Coxeter, Regular Polytopes, (3rd edition, 1973), Dover edition, ISBN 0-486-61480-8, p. 296, Table I (iii): Regular Polytopes, three regular polytopes in n-dimensions (n≥5)
• H.S.M. Coxeter, Regular Polytopes, 3rd Edition, Dover New York, 1973, p. 296, Table I (iii): Regular Polytopes, three regular polytopes in n-dimensions (n≥5)
• Kaleidoscopes: Selected Writings of H.S.M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication, 1995, ISBN 978-0-471-01003-6 [1]
• (Paper 22) H.S.M. Coxeter, Regular and Semi Regular Polytopes I, [Math. Zeit. 46 (1940) 380-407, MR 2,10]
• (Paper 23) H.S.M. Coxeter, Regular and Semi-Regular Polytopes II, [Math. Zeit. 188 (1985) 559-591]
• (Paper 24) H.S.M. Coxeter, Regular and Semi-Regular Polytopes III, [Math. Zeit. 200 (1988) 3-45]
• Norman Johnson Uniform Polytopes, Manuscript (1991)
• N.W. Johnson: The Theory of Uniform Polytopes and Honeycombs, Ph.D. (1966)
• Richard Klitzing, 7D uniform polytopes (polyexa), o3o3o3o3o3o4x - hept