Truncated 7-simplex
Encyclopedia
7-simplex |
Truncated 7-simplex |
|
Bitruncated 7-simplex |
Tritruncated 7-simplex |
|
Orthogonal projections in A7 Coxeter plane |
---|
In seven-dimensional geometry
Geometry
Geometry arose as the field of knowledge dealing with spatial relationships. Geometry was one of the two fields of pre-modern mathematics, the other being the study of numbers ....
, a truncated 7-simplex is a convex uniform 7-polytope, being a truncation
Truncation (geometry)
In geometry, a truncation is an operation in any dimension that cuts polytope vertices, creating a new facet in place of each vertex.- Uniform truncation :...
of the regular 7-simplex.
There are unique 3 degrees of truncation. Vertices of the truncation 7-simplex are located as pairs on the edge of the 7-simplex. Vertices of the bitruncated 7-simplex are located on the triangular faces of the 7-simplex. Vertices of the tritruncated 7-simplex are located inside the tetrahedral
Tetrahedron
In geometry, a tetrahedron is a polyhedron composed of four triangular faces, three of which meet at each vertex. A regular tetrahedron is one in which the four triangles are regular, or "equilateral", and is one of the Platonic solids...
cells of the 7-simplex.
Truncated 7-simplex
Truncated 7-simplex | |
---|---|
Type | uniform polyexon |
Schläfli symbol | t0,1{3,3,3,3,3,3} |
Coxeter-Dynkin diagram Coxeter-Dynkin diagram In geometry, a Coxeter–Dynkin diagram is a graph with numerically labeled edges representing the spatial relations between a collection of mirrors... s |
|
6-faces | 16 |
5-faces | |
4-faces | |
Cells | 350 |
Faces | 336 |
Edges | 196 |
Vertices | 56 |
Vertex figure Vertex figure In geometry a vertex figure is, broadly speaking, the figure exposed when a corner of a polyhedron or polytope is sliced off.-Definitions - theme and variations:... |
Elongated 5-simplex pyramid |
Coxeter group Coxeter group In mathematics, a Coxeter group, named after H.S.M. Coxeter, is an abstract group that admits a formal description in terms of mirror symmetries. Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example... s |
A7, [3,3,3,3,3,3] |
Properties | convex Convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n-dimensional space Rn... , Vertex-transitive Vertex-transitive In geometry, a polytope is isogonal or vertex-transitive if, loosely speaking, all its vertices are the same... |
In seven-dimensional geometry
Geometry
Geometry arose as the field of knowledge dealing with spatial relationships. Geometry was one of the two fields of pre-modern mathematics, the other being the study of numbers ....
, a truncated 7-simplex is a convex uniform 7-polytope, being a truncation
Truncation (geometry)
In geometry, a truncation is an operation in any dimension that cuts polytope vertices, creating a new facet in place of each vertex.- Uniform truncation :...
of the regular 7-simplex.
Coordinates
The vertices of the truncated 7-simplex can be most simply positioned in 8-space as permutations of (0,0,0,0,0,0,1,2). This construction is based on facets of the truncated 8-orthoplexTruncated 8-orthoplex
In eight-dimensional geometry, a truncated 8-orthoplex is a convex uniform 8-polytope, being a truncation of the regular 8-orthoplex.There are 7 truncation for the 8-orthoplex. Vertices of the truncation 8-orthoplex are located as pairs on the edge of the 8-orthoplex. Vertices of the bitruncated...
.
Bitruncated 7-simplex
Bitruncated 7-simplex | |
---|---|
Type | uniform polyexon |
Schläfli symbol | t1,2{3,3,3,3,3,3} |
Coxeter-Dynkin diagram Coxeter-Dynkin diagram In geometry, a Coxeter–Dynkin diagram is a graph with numerically labeled edges representing the spatial relations between a collection of mirrors... s |
|
6-faces | |
5-faces | |
4-faces | |
Cells | |
Faces | |
Edges | 588 |
Vertices | 168 |
Vertex figure Vertex figure In geometry a vertex figure is, broadly speaking, the figure exposed when a corner of a polyhedron or polytope is sliced off.-Definitions - theme and variations:... |
|
Coxeter group Coxeter group In mathematics, a Coxeter group, named after H.S.M. Coxeter, is an abstract group that admits a formal description in terms of mirror symmetries. Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example... s |
A7, [3,3,3,3,3,3] |
Properties | convex Convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n-dimensional space Rn... , Vertex-transitive Vertex-transitive In geometry, a polytope is isogonal or vertex-transitive if, loosely speaking, all its vertices are the same... |
Coordinates
The vertices of the bitruncated 7-simplex can be most simply positioned in 8-space as permutations of (0,0,0,0,0,1,2,2). This construction is based on facets of the bitruncated 8-orthoplex.Tritruncated 7-simplex
Tritruncated 7-simplex | |
---|---|
Type | uniform polyexon |
Schläfli symbol | t2,3{3,3,3,3,3,3} |
Coxeter-Dynkin diagram Coxeter-Dynkin diagram In geometry, a Coxeter–Dynkin diagram is a graph with numerically labeled edges representing the spatial relations between a collection of mirrors... s |
|
6-faces | |
5-faces | |
4-faces | |
Cells | |
Faces | |
Edges | 980 |
Vertices | 280 |
Vertex figure Vertex figure In geometry a vertex figure is, broadly speaking, the figure exposed when a corner of a polyhedron or polytope is sliced off.-Definitions - theme and variations:... |
|
Coxeter group Coxeter group In mathematics, a Coxeter group, named after H.S.M. Coxeter, is an abstract group that admits a formal description in terms of mirror symmetries. Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example... s |
A7, [3,3,3,3,3,3] |
Properties | convex Convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n-dimensional space Rn... , Vertex-transitive Vertex-transitive In geometry, a polytope is isogonal or vertex-transitive if, loosely speaking, all its vertices are the same... |