Concept

Rectified 7-simplexes

In seven-dimensional geometry, a rectified 7-simplex is a convex uniform 7-polytope, being a rectification of the regular 7-simplex. There are four unique degrees of rectifications, including the zeroth, the 7-simplex itself. Vertices of the rectified 7-simplex are located at the edge-centers of the 7-simplex. Vertices of the birectified 7-simplex are located in the triangular face centers of the 7-simplex. Vertices of the trirectified 7-simplex are located in the tetrahedral cell centers of the 7-simplex. The rectified 7-simplex is the edge figure of the 251 honeycomb. It is called 05,1 for its branching Coxeter-Dynkin diagram, shown as . E. L. Elte identified it in 1912 as a semiregular polytope, labeling it as S_1. Rectified octaexon (Acronym: roc) (Jonathan Bowers) The vertices of the rectified 7-simplex can be most simply positioned in 8-space as permutations of (0,0,0,0,0,0,1,1). This construction is based on facets of the rectified 8-orthoplex. E. L. Elte identified it in 1912 as a semiregular polytope, labeling it as S_2. It is also called 04,2 for its branching Coxeter-Dynkin diagram, shown as . Birectified octaexon (Acronym: broc) (Jonathan Bowers) The vertices of the birectified 7-simplex can be most simply positioned in 8-space as permutations of (0,0,0,0,0,1,1,1). This construction is based on facets of the birectified 8-orthoplex. The trirectified 7-simplex is the intersection of two regular 7-simplexes in dual configuration. E. L. Elte identified it in 1912 as a semiregular polytope, labeling it as S_3. This polytope is the vertex figure of the 133 honeycomb. It is called 03,3 for its branching Coxeter-Dynkin diagram, shown as . Hexadecaexon (Acronym: he) (Jonathan Bowers) The vertices of the trirectified 7-simplex can be most simply positioned in 8-space as permutations of (0,0,0,0,1,1,1,1). This construction is based on facets of the trirectified 8-orthoplex. The trirectified 7-simplex is the intersection of two regular 7-simplices in dual configuration.

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.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.