From Surf Wiki (app.surf) — the open knowledge base
8-cube
8-dimensional hypercube
8-dimensional hypercube
| 8-cubeOcteract | |
|---|---|
| [[File:8-cube.svg | 285px]]Orthogonal projectioninside Petrie polygon |
| Type | |
| Family | |
| Schläfli symbol | |
| Coxeter-Dynkin diagrams | |
| 7-faces | |
| 6-faces | |
| 5-faces | |
| 4-faces | |
| Cells | |
| Faces | |
| Edges | |
| Vertices | |
| Vertex figure | |
| Petrie polygon | |
| Coxeter group | |
| Dual | |
| Properties |
In geometry, an 8-cube is an eight-dimensional hypercube. It has 256 vertices, 1024 edges, 1792 square faces, 1792 cubic cells, 1120 tesseract 4-faces, 448 5-cube 5-faces, 112 6-cube 6-faces, and 16 7-cube 7-faces.
It is represented by Schläfli symbol {4,36}, being composed of 3 7-cubes around each 6-face. It is called an octeract, a portmanteau of tesseract (the 4-cube) and oct for eight (dimensions) in Greek. It can also be called a regular hexadeca-8-tope or hexadecazetton, being an 8-dimensional polytope constructed from 16 regular facets.
It is a part of an infinite family of polytopes, called hypercubes. The dual of an 8-cube can be called an 8-orthoplex and is a part of the infinite family of cross-polytopes.
Cartesian coordinates
Cartesian coordinates for the vertices of an 8-cube centered at the origin and edge length 2 are : (±1,±1,±1,±1,±1,±1,±1,±1) while the interior of the same consists of all points (x0, x1, x2, x3, x4, x5, x6, x7) with −1 i
As a configuration
This configuration matrix represents the 8-cube. The rows and columns correspond to vertices, edges, faces, cells, 4-faces, 5-faces, 6-faces, and 7-faces. The diagonal numbers say how many of each element occur in the whole 8-cube. The nondiagonal numbers say how many of the column's element occur in or at the row's element.
\begin{bmatrix}\begin{matrix} 256 & 8 & 28 & 56 & 70 & 56 & 28 & 8 \ 2 & 1024 & 7 & 21 & 35 & 35 & 21 & 7 \ 4 & 4 & 1792 & 6 & 15 & 20 & 15 & 6 \ 8 & 12 & 6 & 1792 & 5 & 10 & 10 & 5 \ 16 & 32 & 24 & 8 & 1120 & 4 & 6 & 4 \ 32 & 80 & 80 & 40 & 10 & 448 & 3 & 3 \ 64 & 192 & 240 & 160 & 60 & 12 & 112 & 2 \ 128 & 448 & 672 & 560 & 280 & 84 & 14 & 16 \end{matrix}\end{bmatrix}
The diagonal f-vector numbers are derived through the Wythoff construction, dividing the full group order of a subgroup order by removing one mirror at a time.
| B8 | k-face | fk | f0 | f1 | f2 | f3 | f4 | f5 | f6 | f7 | k-figure | Notes | f0 | f1 | f2 | f3 | f4 | f5 | f6 | f7 | ||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| A7 | ( ) | 256 | 8 | 28 | 56 | 70 | 56 | |||||||||||||||||||||||||||
| A6A1 | { } | 2 | 1024 | 7 | 21 | 35 | 35 | |||||||||||||||||||||||||||
| A5B2 | {4} | 4 | 4 | 1792 | 6 | 15 | 20 | |||||||||||||||||||||||||||
| A4B3 | {4,3} | 8 | 12 | 6 | 1792 | 5 | 10 | |||||||||||||||||||||||||||
| A3B4 | {4,3,3} | 16 | 32 | 24 | 8 | 1120 | 4 | |||||||||||||||||||||||||||
| A2B5 | {4,3,3,3} | 32 | 80 | 80 | 40 | 10 | 448 | |||||||||||||||||||||||||||
| A1B6 | {4,3,3,3,3} | 64 | 192 | 240 | 160 | 60 | 12 | |||||||||||||||||||||||||||
| B7 | {{CDD | node_x | 2 | node | 3 | node | 3 | node | 3 | node | 3 | node | 3 | node | 4 | node_1}} | {4,3,3,3,3,3} | 128 | 448 | 672 | 560 | 280 |
Projections
| [[Image:8-cube column graph.svg | 240px]]This 8-cube 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:8:28:56:70:56:28:8:1. |
|---|
Derived polytopes
Applying an alternation operation, deleting alternating vertices of the octeract, creates another uniform polytope, called an 8-demicube, (part of an infinite family called demihypercubes), which has 16 demihepteractic and 128 8-simplex facets.
References
- H.S.M. Coxeter:
- Coxeter, Regular Polytopes, (3rd edition, 1973), Dover, , 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, wiley.com,
- (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)
References
- Coxeter, Regular Polytopes, sec 1.8 Configurations
- Coxeter, Complex Regular Polytopes, p.117
- {{KlitzingPolytopes. ../incmats/octo.htm. o3o3o3o3o3o3o4x - octo
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about 8-cube — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report