Concept

5-simplex

Summary
In five-dimensional geometry, a 5-simplex is a self-dual regular 5-polytope. It has six vertices, 15 edges, 20 triangle faces, 15 tetrahedral cells, and 6 5-cell facets. It has a dihedral angle of cos−1(1/5), or approximately 78.46°. The 5-simplex is a solution to the problem: Make 20 equilateral triangles using 15 matchsticks, where each side of every triangle is exactly one matchstick. It can also be called a hexateron, or hexa-5-tope, as a 6-facetted polytope in 5-dimensions. The name hexateron is derived from hexa- for having six facets and teron (with ter- being a corruption of tetra-) for having four-dimensional facets. By Jonathan Bowers, a hexateron is given the acronym hix. This configuration matrix represents the 5-simplex. The rows and columns correspond to vertices, edges, faces, cells and 4-faces. The diagonal numbers say how many of each element occur in the whole 5-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. The hexateron can be constructed from a 5-cell by adding a 6th vertex such that it is equidistant from all the other vertices of the 5-cell. The Cartesian coordinates for the vertices of an origin-centered regular hexateron having edge length 2 are: The vertices of the 5-simplex can be more simply positioned on a hyperplane in 6-space as permutations of (0,0,0,0,0,1) or (0,1,1,1,1,1). These construction can be seen as facets of the 6-orthoplex or rectified 6-cube respectively. A lower symmetry form is a 5-cell pyramid {3,3,3}∨( ), with [3,3,3] symmetry order 120, constructed as a 5-cell base in a 4-space hyperplane, and an apex point above the hyperplane. The five sides of the pyramid are made of 5-cell cells. These are seen as vertex figures of truncated regular 6-polytopes, like a truncated 6-cube. Another form is {3,3}∨{ }, with [3,3,2,1] symmetry order 48, the joining of an orthogonal digon and a tetrahedron, orthogonally offset, with all pairs of vertices connected between.
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.