10-cube

10-cube Dekeract
File:10-cube.svg Orthogonal projection inside Petrie polygon Orange vertices are doubled, and central yellow one has four
Type	Regular 10-polytope
Family	hypercube
Schläfli symbol	{4,38}
Coxeter-Dynkin diagram	Template:CDD
9-faces	20 {4,37} File:9-cube.svg
8-faces	180 {4,36} File:8-cube.svg
7-faces	960 {4,35} File:7-cube graph.svg
6-faces	3360 {4,34} File:6-cube graph.svg
5-faces	8064 {4,33} File:5-cube graph.svg
4-faces	13440 {4,3,3} File:4-cube graph.svg
Cells	15360 {4,3} File:3-cube graph.svg
Faces	11520 squares File:2-cube.svg
Edges	5120 segments File:1-simplex t0.svg
Vertices	1024 points File:0-point t0.svg
Vertex figure	9-simplex File:9-simplex graph.svg
Petrie polygon	icosagon
Coxeter group	C10, [38,4]
Dual	10-orthoplex File:10-orthoplex.svg
Properties	convex, Hanner polytope

In geometry, a 10-cube is a ten-dimensional hypercube. It has 1024 vertices, 5120 edges, 11520 square faces, 15360 cubic cells, 13440 tesseract 4-faces, 8064 5-cube 5-faces, 3360 6-cube 6-faces, 960 7-cube 7-faces, 180 8-cube 8-faces, and 20 9-cube 9-faces.

It can be named by its Schläfli symbol {4,3⁸}, being composed of 3 9-cubes around each 8-face. It is sometimes called a dekeract, a portmanteau of tesseract (the 4-cube) and deka- for ten (dimensions) in Greek, It can also be called an icosaronnon or icosa-10-tope as a 10 dimensional polytope, constructed from 20 regular facets.

It is a part of an infinite family of polytopes, called hypercubes. The dual of a dekeract can be called a 10-orthoplex or decacross, and is a part of the infinite family of cross-polytopes.

Cartesian coordinates

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

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

while the interior of the same consists of all points (x₀, x₁, x₂, x₃, x₄, x₅, x₆, x₇, x₈, x₉) with −1 < x_i < 1.

Other images

File:10-cube column graph.svg This 10-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 numbers of vertices in each column are a row of Pascal's triangle: 1, 10, 45, 120, 210, 252, 210, 120, 45, 10, 1.

Orthographic projections

B10	B9	B8
File:10-cube t0.svg	File:10-cube t0 B9.svg	File:10-cube t0 B8.svg
[20]	[18]	[16]
B7	B6	B5
File:10-cube t0 B7.svg	File:10-cube t0 B6.svg	File:10-cube t0 B5.svg
[14]	[12]	[10]
B4	B3	B2
File:10-cube t0 B4.svg	File:10-cube t0 B3.svg	File:10-cube t0 B2.svg
[8]	[6]	[4]
A9		A5
File:10-cube t0 A9.svg		File:10-cube t0 A5.svg
[10]		[6]
A7		A3
File:10-cube t0 A7.svg		File:10-cube t0 A3.svg
[8]		[4]

Derived polytopes

Applying an alternation operation, deleting alternating vertices of the dekeract, creates another uniform polytope, called a 10-demicube, (part of an infinite family called demihypercubes), which has 20 demienneractic and 512 enneazettonic facets.

References

• H.S.M. Coxeter:
  • H.S.M. Coxeter, Regular Polytopes, 1973, 3rd edition, Dover, New York, p. 296, Table I (iii): Regular Polytopes, three regular polytopes in n dimensions (n ≥ 5), Template:Isbn
  • 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, Template:Isbn
    • (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)
• Klitzing, Richard. "10D uniform polytopes (polyxenna) o3o3o3o3o3o3o3o3o4x - deker".

External links

• Template:GlossaryForHyperspace
• Multi-dimensional Glossary: hypercube Garrett Jones
• Template:OEIS el