Gosset 3 21 polytope
Encyclopedia

231

Rectified 321

Birectified 321

Rectified 132

132

231

Rectified 231
Orthogonal projections in E6 Coxeter plane

In 7-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 ....

, the 321 polytope is a uniform 6-polytope, constructed within the symmetry of the E7 group. It was discovered by Thorold Gosset
Thorold Gosset
Thorold Gosset was an English lawyer and an amateur mathematician. In mathematics, he is noted for discovering and classifying the semiregular polytopes in dimensions four and higher.According to H. S. M...

, published in his 1900 paper. He called it an 6-ic semi-regular figure.

Coxeter named it 321 by its bifurcating 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...

, 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. The trirectified 321 is constructed by points at the tetrahedral centers of the 321, and is the same as the rectified 132.

These polytopes are part of a family of 127 (27-1) convex uniform polytopes in 7-dimensions, made of uniform 6-polytope facets and 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:...

s, defined by all permutations of rings in this 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...

: .

321 polytope

This polytope, along with the 7-simplex, can tessellate
Honeycomb (geometry)
In geometry, a honeycomb is a space filling or close packing of polyhedral or higher-dimensional cells, so that there are no gaps. It is an example of the more general mathematical tiling or tessellation in any number of dimensions....

 7-dimensional space, represented by 331 and Coxeter-Dynkin diagram: .
321 polytope
Type Uniform 7-polytope
Family k21 polytope
Schläfli symbol {3,3,3,32,1}
Coxeter symbol 321
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...

6-faces 702 total:
126 311
Hexacross
In geometry, a 6-orthoplex, or 6-cross polytope, is a regular 6-polytope with 12 vertices, 60 edges, 160 triangle faces, 240 tetrahedron cells, 192 5-cell 4-faces, and 64 5-faces....


576 {35}
5-faces 6048:
4032 {34}
2016 {34}
4-faces 12096 {33}
Pentachoron
In geometry, the 5-cell is a four-dimensional object bounded by 5 tetrahedral cells. It is also known as the pentachoron, pentatope, or hyperpyramid...

Cells 10080 {3,3}
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...

Faces 4032 {3}
Triangle
A triangle is one of the basic shapes of geometry: a polygon with three corners or vertices and three sides or edges which are line segments. A triangle with vertices A, B, and C is denoted ....

Edges 756
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:...

221 polytope
Gosset 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....

Petrie polygon
Petrie polygon
In geometry, a Petrie polygon for a regular polytope of n dimensions is a skew polygon such that every consecutive sides belong to one of the facets...

octadecagon
Octadecagon
An octadecagon is a polygon with 18 sides and 18 vertices. Another name for an octadecagon is octakaidecagon.- Construction :A regular octadecagon cannot be constructed using compass and straightedge.- Petrie polygons :...

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...

E7, [33,2,1]
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...


In 7-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 ....

, the 321 is a uniform polytope
Uniform polytope
A uniform polytope is a vertex-transitive polytope made from uniform polytope facets of a lower dimension. Uniform polytopes of 2 dimensions are the regular polygons....

. It has 56 vertices, and 702 facets: 126 311
Hexacross
In geometry, a 6-orthoplex, or 6-cross polytope, is a regular 6-polytope with 12 vertices, 60 edges, 160 triangle faces, 240 tetrahedron cells, 192 5-cell 4-faces, and 64 5-faces....

 and 576 6-simplex.

For visualization this 7-dimensional polytope is often displayed in a special skewed orthographic projection direction that fits its 56 vertices within a 18-gonal regular polygon (called a Petrie polygon
Petrie polygon
In geometry, a Petrie polygon for a regular polytope of n dimensions is a skew polygon such that every consecutive sides belong to one of the facets...

). Its 756 edges are drawn between 3 rings of 18 vertices, and 2 vertices in the center. Specific higher elements (faces, cells, etc) can also be extracted and drawn on this projection.

The 1-skeleton
N-skeleton
In mathematics, particularly in algebraic topology, the n-skeleton of a topological space X presented as a simplicial complex refers to the subspace Xn that is the union of the simplices of X of dimensions m ≤ n...

 of the 321 polytope is called a Gosset graph
Gosset graph
The Gosset graph, named after Thorold Gosset, is a specific regular graph with 56 vertices and valency 27.-Construction:...

.

Alternate names

  • It is also called the Hess polytope for Edmund Hess
    Edmund Hess
    Edmund Hess was a German mathematician who discovered several regular polytopes.- References :* Regular Polytopes, , Dover edition, ISBN 0-486-61480-8...

     who first discovered it.
  • It was enumerated by Thorold Gosset
    Thorold Gosset
    Thorold Gosset was an English lawyer and an amateur mathematician. In mathematics, he is noted for discovering and classifying the semiregular polytopes in dimensions four and higher.According to H. S. M...

     in his 1900 paper. He called it an 7-ic semi-regular figure.
  • E. L. Elte
    E. L. Elte
    Emanuel Lodewijk Elte was a Dutch mathematician. He is noted for discovering and classifying semiregular polytopes in dimensions four and higher....

     named it V56 (for its 56 vertices) in his 1912 listing of semiregular polytopes.
  • H.S.M. Coxeter called it 321 due to its bifurcating 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...

    , having 3 branches of length 3, 2, and 1, and having a single nodea_1 on the final node of the 3 branch.
  • Hecatonicosihexa-pentacosiheptacontihexa-exon (Acronym Naq) - 126-576 facetted polyexon (Jonathan Bowers)

Coordinates

The 56 vertices can be most simply represented in 8-dimensional space, obtained by the 28 permutations of the coordinates and their opposite:
± (-3, -3, 1, 1, 1, 1, 1, 1)

Construction

Its construction is based on the E7 group. Coxeter named it as 321 by its bifurcating 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...

, with a single nodea_1 on the end of the 3-node sequence.

The facet information can be extracted from its 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...

, .

Removing the node on the short branch leaves the 6-simplex, .

Removing the node on the end of the 2-length branch leaves the 6-orthoplex in its alternated form: 311, .

Every simplex facet touches an 6-orthoplex facet, while alternate facets of the orthoplex touch either a simplex or another orthoplex.

The 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:...

 is determined by removing the ringed node and ringing the neighboring node. This makes 221
Gosset 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....

 polytope, .

Images

Coxeter plane projections
E7 E6 / F4 B7 / A6

[18]

[12]

[7x2]
A5 D7 / B6 D6 / B5

[6]

[12/2]

[10]
D5 / B4 / A4 D4 / B3 / A2 / G2 D3 / B2 / A3

[8]

[6]

[4]

Rectified 321 polytope

Rectified 321 polytope
Type Uniform 7-polytope
Schläfli symbol t1{3,3,3,32,1}
Coxeter symbol t1(321)
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...

6-faces 758
5-faces 44352
4-faces 70560
Cells 48384
Faces 11592
Edges 12096
Vertices 756
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:...

5-demicube prism
Petrie polygon
Petrie polygon
In geometry, a Petrie polygon for a regular polytope of n dimensions is a skew polygon such that every consecutive sides belong to one of the facets...

octadecagon
Octadecagon
An octadecagon is a polygon with 18 sides and 18 vertices. Another name for an octadecagon is octakaidecagon.- Construction :A regular octadecagon cannot be constructed using compass and straightedge.- Petrie polygons :...

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...

E7, [33,2,1]
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...


Alternate names

  • Rectified hecatonicosihexa-pentacosiheptacontihexa-exon as a rectified 126-576 facetted polyexon (acronym ranq) (Jonathan Bowers)

Construction

Its construction is based on the E7 group. Coxeter named it as 321 by its bifurcating 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...

, with a single node on the end of the 3-node sequence.

The facet information can be extracted from its 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...

, .

Removing the node on the short branch leaves the 6-simplex, .

Removing the node on the end of the 2-length branch leaves the rectified 6-orthoplex in its alternated form: t1311, .

Removing the node on the end of the 3-length branch leaves the 221, .

The 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:...

 is determined by removing the ringed node and ringing the neighboring node. This makes 5-demicube prism, .

Images

Coxeter plane projections
E7 E6 / F4 B7 / A6

[18]

[12]

[7x2]
A5 D7 / B6 D6 / B5

[6]

[12/2]

[10]
D5 / B4 / A4 D4 / B3 / A2 / G2 D3 / B2 / A3

[8]

[6]

[4]

Birectified 321 polytope

Birectified 321 polytope
Type Uniform 7-polytope
Schläfli symbol t1{3,3,3,32,1}
Coxeter symbol t1(321)
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...

6-faces 758
5-faces 12348
4-faces 68040
Cells 161280
Faces 161280
Edges 60480
Vertices 4032
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:...

5-cell-triangle duoprism
Petrie polygon
Petrie polygon
In geometry, a Petrie polygon for a regular polytope of n dimensions is a skew polygon such that every consecutive sides belong to one of the facets...

octadecagon
Octadecagon
An octadecagon is a polygon with 18 sides and 18 vertices. Another name for an octadecagon is octakaidecagon.- Construction :A regular octadecagon cannot be constructed using compass and straightedge.- Petrie polygons :...

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...

E7, [33,2,1]
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...


Alternate names

  • Birectified hecatonicosihexa-pentacosiheptacontihexa-exon as a birectified 126-576 facetted polyexon (acronym branq) (Jonathan Bowers)

Construction

Its construction is based on the E7 group. Coxeter named it as 321 by its bifurcating 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...

, with a single node on the end of the 3-node sequence.

The facet information can be extracted from its 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...

, .

Removing the node on the short branch leaves the birectified 6-simplex, .

Removing the node on the end of the 2-length branch leaves the birectified 6-orthoplex in its alternated form: t2(311), .

Removing the node on the end of the 3-length branch leaves the rectified 221 polytope in its alternated form: t1(221), .

The 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:...

 is determined by removing the ringed node and ringing the neighboring node. This makes 5-cell-triangle duoprism, .

Images

Coxeter plane projections
E7 E6 / F4 B7 / A6

[18]

[12]

[7x2]
A5 D7 / B6 D6 / B5

[6]

[12/2]

[10]
D5 / B4 / A4 D4 / B3 / A2 / G2 D3 / B2 / A3

[8]

[6]

[4]
The source of this article is wikipedia, the free encyclopedia.  The text of this article is licensed under the GFDL.
 
x
OK