2 31 polytope

DISPLAYTITLE:2 31 polytope In 7-dimensional geometry, 231 is a uniform polytope, constructed from the E7 group. Its Coxeter symbol is 231, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of the 2-node branch. The rectified 231 is constructed by points at the mid-edges of the 231. These polytopes are part of a family of 127 (or 27−1) convex uniform polytopes in 7-dimensions, made of uniform polytope facets and vertex figures, defined by all permutations of rings in this Coxeter-Dynkin diagram: . The 231 is composed of 126 vertices, 2016 edges, 10080 faces (Triangles), 20160 cells (tetrahedra), 16128 4-faces (3-simplexes), 4788 5-faces (756 pentacrosses, and 4032 5-simplexes), 632 6-faces (576 6-simplexes and 56 221). Its vertex figure is a 6-demicube. Its 126 vertices represent the root vectors of the simple Lie group E7. This polytope is the vertex figure for a uniform tessellation of 7-dimensional space, 331. E. L. Elte named it V126 (for its 126 vertices) in his 1912 listing of semiregular polytopes. It was called 231 by Coxeter for its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of the 2-node sequence. Pentacontihexa-pentacosiheptacontihexa-exon (Acronym laq) - 56-576 facetted polyexon (Jonathan Bowers) It is created by a Wythoff construction upon a set of 7 hyperplane mirrors in 7-dimensional space. The facet information can be extracted from its Coxeter-Dynkin diagram, . Removing the node on the short branch leaves the 6-simplex. There are 576 of these facets. These facets are centered on the locations of the vertices of the 321 polytope, . Removing the node on the end of the 3-length branch leaves the 221. There are 56 of these facets. These facets are centered on the locations of the vertices of the 132 polytope, . The vertex figure is determined by removing the ringed node and ringing the neighboring node. This makes the 6-demicube, 131, . Seen in a configuration matrix, the element counts can be derived by mirror removal and ratios of Coxeter group orders.

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 (16)

Related lectures (1)

1 32 polytope

DISPLAYTITLE:1 32 polytope In 7-dimensional geometry, 132 is a uniform polytope, constructed from the E7 group. Its Coxeter symbol is 132, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of one of the 1-node sequences. The rectified 132 is constructed by points at the mid-edges of the 132. These polytopes are part of a family of 127 (27-1) convex uniform polytopes in 7-dimensions, made of uniform polytope facets and vertex figures, defined by all permutations of rings in this Coxeter-Dynkin diagram: .

Octadecagon

In geometry, an octadecagon (or octakaidecagon) or 18-gon is an eighteen-sided polygon. A regular octadecagon has a Schläfli symbol {18} and can be constructed as a quasiregular truncated enneagon, t{9}, which alternates two types of edges. As 18 = 2 × 32, a regular octadecagon cannot be constructed using a compass and straightedge. However, it is constructible using neusis, or an angle trisection with a tomahawk. The following approximate construction is very similar to that of the enneagon, as an octadecagon can be constructed as a truncated enneagon.

2 21 polytope

DISPLAYTITLE:2 21 polytope In 6-dimensional geometry, the 221 polytope is a uniform 6-polytope, constructed within the symmetry of the E6 group. It was discovered by Thorold Gosset, published in his 1900 paper. He called it an 6-ic semi-regular figure. It is also called the Schläfli polytope. Its Coxeter symbol is 221, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of one of the 2-node sequences. He also studied its connection with the 27 lines on the cubic surface, which are naturally in correspondence with the vertices of 221.

Gram-Schmidt Process and QR Decomposition MATH-111(e): Linear Algebra

Covers the Gram-Schmidt process, QR decomposition, orthogonal projection theorem, and matrix formulas.