7-simplex | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

In 7-dimensional geometry, a 7-simplex is a self-dual regular 7-polytope. It has 8 vertices, 28 edges, 56 triangle faces, 70 tetrahedral cells, 56 5-cell 5-faces, 28 5-simplex 6-faces, and 8 6-simplex 7-faces. Its dihedral angle is cos−1(1/7), or approximately 81.79°. It can also be called an octaexon, or octa-7-tope, as an 8-facetted polytope in 7-dimensions. The name octaexon is derived from octa for eight facets in Greek and -ex for having six-dimensional facets, and -on. Jonathan Bowers gives an octaexon the acronym oca. This configuration matrix represents the 7-simplex. The rows and columns correspond to vertices, edges, faces, cells, 4-faces, 5-faces and 6-faces. The diagonal numbers say how many of each element occur in the whole 7-simplex. The nondiagonal numbers say how many of the column's element occur in or at the row's element. This self-dual simplex's matrix is identical to its 180 degree rotation. There are many lower symmetry constructions of the 7-simplex. Some are expressed as join partitions of two or more lower simplexes. The symmetry order of each join is the product of the symmetry order of the elements, and raised further if identical elements can be interchanged. The Cartesian coordinates of the vertices of an origin-centered regular octaexon having edge length 2 are: More simply, the vertices of the 7-simplex can be positioned in 8-space as permutations of (0,0,0,0,0,0,0,1). This construction is based on facets of the 8-orthoplex. This polytope is a facet in the uniform tessellation 331 with Coxeter-Dynkin diagram: This polytope is one of 71 uniform 7-polytopes with A7 symmetry.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (3)

3 21 polytope

DISPLAYTITLE:3 21 polytope In 7-dimensional geometry, the 321 polytope is a uniform 7-polytope, constructed within the symmetry of the E7 group. It was discovered by Thorold Gosset, published in his 1900 paper. He called it an 7-ic semi-regular figure. Its Coxeter symbol is 321, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of one of the 3-node sequences. The rectified 321 is constructed by points at the mid-edges of the 321. The birectified 321 is constructed by points at the triangle face centers of the 321.

Simplex

In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. For example, a 0-dimensional simplex is a point, a 1-dimensional simplex is a line segment, a 2-dimensional simplex is a triangle, a 3-dimensional simplex is a tetrahedron, and a 4-dimensional simplex is a 5-cell. Specifically, a k-simplex is a k-dimensional polytope which is the convex hull of its k + 1 vertices.

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 reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced in 1934 as abstractions of reflection groups , and finite Coxeter groups were classified in 1935 .