3-3 duoprism

Last updated
3-3 duoprism
3-3 duoprism.png
Schlegel diagram
TypeUniform duoprism
Schläfli symbol {3}×{3} = {3}2
Coxeter diagram CDel node 1.pngCDel 3.pngCDel node.pngCDel 2.pngCDel node 1.pngCDel 3.pngCDel node.png
Cells6 triangular prisms
Faces9 squares,
6 triangles
Edges18
Vertices9
Vertex figure 33-duoprism verf.png
Tetragonal disphenoid
Symmetry [[3,2,3]] = [6,2+,6], order 72
Dual 3-3 duopyramid
Properties convex, vertex-uniform, facet-transitive

In the geometry of 4 dimensions, the 3-3 duoprism or triangular duoprism is a four-dimensional convex polytope. It can be constructed as the Cartesian product of two triangles and is the simplest of an infinite family of four-dimensional polytopes constructed as Cartesian products of two polygons, the duoprisms.

Contents

It has 9 vertices, 18 edges, 15 faces (9 squares, and 6 triangles), in 6 triangular prism cells. It has Coxeter diagram CDel branch 10.pngCDel 2.pngCDel branch 10.png, and symmetry [[3,2,3]], order 72. Its vertices and edges form a rook's graph.

Hypervolume

The hypervolume of a uniform 3-3 duoprism, with edge length a, is . This is the square of the area of an equilateral triangle, .

Graph

The graph of vertices and edges of the 3-3 duoprism has 9 vertices and 18 edges. Like the Berlekamp–van Lint–Seidel graph and the unknown solution to Conway's 99-graph problem, every edge is part of a unique triangle and every non-adjacent pair of vertices is the diagonal of a unique square. It is a toroidal graph, a locally linear graph, a strongly regular graph with parameters (9,4,1,2), the rook's graph, and the Paley graph of order 9. [1] This graph is also the Cayley graph of the group with generating set .

Images

Orthogonal projections
3-3 duoprism ortho-dih3.png 3-3 duoprism-isotoxal.svg 3-3 duoprism ortho-Dih3.png 3-3 duoprism ortho square.png
3,3 duoprism net.png Triangular Duoprism YW and ZW Rotations.gif
Net3D perspective projection with 2 different rotations

Symmetry

In 5-dimensions, some uniform 5-polytopes have 3-3 duoprism vertex figures, some with unequal edge-lengths and therefore lower symmetry:

Symmetry[[3,2,3]], order 72[3,2], order 12
Coxeter
diagram
CDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node 1.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
CDel nodes.pngCDel split2.pngCDel node 1.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
CDel node 1.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node 1.pngCDel 3.pngCDel node.pngCDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node 1.pngCDel 3.pngCDel node.pngCDel node 1.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node 1.pngCDel 4.pngCDel node.png
Schlegel
diagram
Birectified hexateron verf.png Runcinated 5-simplex verf.png Runcinated penteract verf.png Runcinated pentacross verf.png
Name t2α5 t03α5 t03γ5 t03β5

The birectified 16-cell honeycomb also has a 3-3 duoprism vertex figure. There are three constructions for the honeycomb with two lower symmetries.

Symmetry[3,2,3], order 36[3,2], order 12[3], order 6
Coxeter
diagram
CDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel node.pngCDel 4.pngCDel node 1.pngCDel 3.pngCDel node.pngCDel split1.pngCDel nodes 10lu.pngCDel node.pngCDel 3.pngCDel node.pngCDel splitsplit1.pngCDel branch3 11.pngCDel node 1.png
Skew
orthogonal
projection
Birectified 16-cell honeycomb verf.png Birectified 16-cell honeycomb verf2.png Birectified 16-cell honeycomb verf3.png

The regular complex polytope 3{4}2, CDel 3node 1.pngCDel 4.pngCDel node.png, in has a real representation as a 3-3 duoprism in 4-dimensional space. 3{4}2 has 9 vertices, and 6 3-edges. Its symmetry is 3[4]2, order 18. It also has a lower symmetry construction, CDel 3node 1.pngCDel 2.pngCDel 3node 1.png, or 3{}×3{}, with symmetry 3[2]3, order 9. This is the symmetry if the red and blue 3-edges are considered distinct. [2]

Complex polygon 3-4-2-stereographic2.png
Perspective projection
3-generalized-2-cube.svg
Orthogonal projection with coinciding central vertices
3-generalized-2-cube skew.svg
Orthogonal projection, offset view to avoid overlapping elements.
k22 figures in n dimensions
SpaceFiniteEuclideanHyperbolic
n 4 5 6 7 8
Coxeter
group
A2A2E6=E6+=E6++
Coxeter
diagram
CDel nodes.pngCDel 3ab.pngCDel nodes 11.pngCDel nodes.pngCDel 3ab.pngCDel nodes.pngCDel split2.pngCDel node 1.pngCDel nodes.pngCDel 3ab.pngCDel nodes.pngCDel split2.pngCDel node.pngCDel 3.pngCDel node 1.pngCDel nodes.pngCDel 3ab.pngCDel nodes.pngCDel split2.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node 1.pngCDel nodes.pngCDel 3ab.pngCDel nodes.pngCDel split2.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node 1.png
Symmetry [[32,2,-1]][[32,2,0]][[32,2,1]][[32,2,2]][[32,2,3]]
Order 721440103,680
Graph 3-3 duoprism ortho-skew.png 5-simplex t2.svg Up 1 22 t0 E6.svg
Name 122 022 122 222 322

3-3 duopyramid

3-3 duopyramid
TypeUniform dual duopyramid
Schläfli symbol {3}+{3} = 2{3}
Coxeter diagram CDel node f1.pngCDel 3.pngCDel node.pngCDel 2x.pngCDel node f1.pngCDel 3.pngCDel node.png
Cells9 tetragonal disphenoids
Faces18 isosceles triangles
Edges15 (9+6)
Vertices6 (3+3)
Symmetry [[3,2,3]] = [6,2+,6], order 72
Dual 3-3 duoprism
Properties convex, vertex-uniform, facet-transitive

The dual of a 3-3 duoprism is called a 3-3 duopyramid or triangular duopyramid. It has 9 tetragonal disphenoid cells, 18 triangular faces, 15 edges, and 6 vertices.

It can be seen in orthogonal projection as a 6-gon circle of vertices, and edges connecting all pairs, just like a 5-simplex seen in projection.

3-3 duopyramid ortho.png
orthogonal projection

The regular complex polygon 2{4}3, also 3{ }+3{ } has 6 vertices in with a real representation in matching the same vertex arrangement of the 3-3 duopyramid. It has 9 2-edges corresponding to the connecting edges of the 3-3 duopyramid, while the 6 edges connecting the two triangles are not included. It can be seen in a hexagonal projection with 3 sets of colored edges. This arrangement of vertices and edges makes a complete bipartite graph with each vertex from one triangle is connected to every vertex on the other. It is also called a Thomsen graph or 4-cage. [3]

Complex polygon 2-4-3-bipartite graph.png
The 2{4}3 with 6 vertices in blue and red connected by 9 2-edges as a complete bipartite graph.
Complex polygon 2-4-3.png
It has 3 sets of 3 edges, seen here with colors.

See also

Notes

  1. Makhnev, A. A.; Minakova, I. M. (January 2004), "On automorphisms of strongly regular graphs with parameters , ", Discrete Mathematics and Applications, 14 (2), doi:10.1515/156939204872374, MR   2069991, S2CID   118034273
  2. Coxeter, H. S. M.; Regular Complex Polytopes, Cambridge University Press, (1974).
  3. Regular Complex Polytopes, p.110, p.114

Related Research Articles

<span class="mw-page-title-main">Convex uniform honeycomb</span> Spatial tiling of convex uniform polyhedra

In geometry, a convex uniform honeycomb is a uniform tessellation which fills three-dimensional Euclidean space with non-overlapping convex uniform polyhedral cells.

<span class="mw-page-title-main">Cuboctahedron</span> Polyhedron with 8 triangular faces and 6 square faces

A cuboctahedron is a polyhedron with 8 triangular faces and 6 square faces. A cuboctahedron has 12 identical vertices, with 2 triangles and 2 squares meeting at each, and 24 identical edges, each separating a triangle from a square. As such, it is a quasiregular polyhedron, i.e. an Archimedean solid that is not only vertex-transitive but also edge-transitive. It is radially equilateral.

<span class="mw-page-title-main">Cube</span> Solid object with six equal square faces

In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets, or sides, with three meeting at each vertex. Viewed from a corner, it is a hexagon and its net is usually depicted as a cross.

<span class="mw-page-title-main">Octahedron</span> Polyhedron with eight triangular faces

In geometry, an octahedron is a polyhedron with eight faces. The term is most commonly used to refer to the regular octahedron, a Platonic solid composed of eight equilateral triangles, four of which meet at each vertex.

<span class="mw-page-title-main">4-polytope</span> Four-dimensional geometric object with flat sides

In geometry, a 4-polytope is a four-dimensional polytope. It is a connected and closed figure, composed of lower-dimensional polytopal elements: vertices, edges, faces (polygons), and cells (polyhedra). Each face is shared by exactly two cells. The 4-polytopes were discovered by the Swiss mathematician Ludwig Schläfli before 1853.

<span class="mw-page-title-main">Tesseract</span> Four-dimensional analogue of the cube

In geometry, a tesseract or 4-cube is a four-dimensional hypercube, analogous to a two-dimensional square and a three-dimensional cube. Just as the perimeter of the square consists of four edges and the surface of the cube consists of six square faces, the hypersurface of the tesseract consists of eight cubical cells, meeting at right angles. The tesseract is one of the six convex regular 4-polytopes.

<span class="mw-page-title-main">Schläfli symbol</span> Notation that defines regular polytopes and tessellations

In geometry, the Schläfli symbol is a notation of the form that defines regular polytopes and tessellations.

<span class="mw-page-title-main">Cross-polytope</span> Regular polytope dual to the hypercube in any number of dimensions

In geometry, a cross-polytope, hyperoctahedron, orthoplex, or cocube is a regular, convex polytope that exists in n-dimensional Euclidean space. A 2-dimensional cross-polytope is a square, a 3-dimensional cross-polytope is a regular octahedron, and a 4-dimensional cross-polytope is a 16-cell. Its facets are simplexes of the previous dimension, while the cross-polytope's vertex figure is another cross-polytope from the previous dimension.

<span class="mw-page-title-main">16-cell</span> Four-dimensional analog of the octahedron

In geometry, the 16-cell is the regular convex 4-polytope (four-dimensional analogue of a Platonic solid) with Schläfli symbol {3,3,4}. It is one of the six regular convex 4-polytopes first described by the Swiss mathematician Ludwig Schläfli in the mid-19th century. It is also called C16, hexadecachoron, or hexdecahedroid [sic?].

<span class="mw-page-title-main">Duoprism</span> Cartesian product of two polytopes

In geometry of 4 dimensions or higher, a double prism or duoprism is a polytope resulting from the Cartesian product of two polytopes, each of two dimensions or higher. The Cartesian product of an n-polytope and an m-polytope is an (n+m)-polytope, where n and m are dimensions of 2 (polygon) or higher.

<span class="mw-page-title-main">Cubic honeycomb</span> Only regular space-filling tessellation of the cube

The cubic honeycomb or cubic cellulation is the only proper regular space-filling tessellation in Euclidean 3-space made up of cubic cells. It has 4 cubes around every edge, and 8 cubes around each vertex. Its vertex figure is a regular octahedron. It is a self-dual tessellation with Schläfli symbol {4,3,4}. John Horton Conway called this honeycomb a cubille.

<span class="mw-page-title-main">Truncated 5-cell</span>

In geometry, a truncated 5-cell is a uniform 4-polytope formed as the truncation of the regular 5-cell.

<span class="mw-page-title-main">Grand antiprism</span> Uniform 4-polytope bounded by 320 cells

In geometry, the grand antiprism or pentagonal double antiprismoid is a uniform 4-polytope (4-dimensional uniform polytope) bounded by 320 cells: 20 pentagonal antiprisms, and 300 tetrahedra. It is an anomalous, non-Wythoffian uniform 4-polytope, discovered in 1965 by Conway and Guy. Topologically, under its highest symmetry, the pentagonal antiprisms have D5d symmetry and there are two types of tetrahedra, one with S4 symmetry and one with Cs symmetry.

In geometry, a complex polytope is a generalization of a polytope in real space to an analogous structure in a complex Hilbert space, where each real dimension is accompanied by an imaginary one.

<span class="mw-page-title-main">Uniform 5-polytope</span> Five-dimensional geometric shape

In geometry, a uniform 5-polytope is a five-dimensional uniform polytope. By definition, a uniform 5-polytope is vertex-transitive and constructed from uniform 4-polytope facets.

1<sub> 22</sub> polytope Uniform 6-polytope

In 6-dimensional geometry, the 122 polytope is a uniform polytope, constructed from the E6 group. It was first published in E. L. Elte's 1912 listing of semiregular polytopes, named as V72 (for its 72 vertices).

4<sub> 21</sub> polytope

In 8-dimensional geometry, the 421 is a semiregular uniform 8-polytope, constructed within the symmetry of the E8 group. It was discovered by Thorold Gosset, published in his 1900 paper. He called it an 8-ic semi-regular figure.

<span class="mw-page-title-main">Simplicial honeycomb</span> Tiling of n-dimensional space

In geometry, the simplicial honeycomb is a dimensional infinite series of honeycombs, based on the affine Coxeter group symmetry. It is represented by a Coxeter-Dynkin diagram as a cyclic graph of n + 1 nodes with one node ringed. It is composed of n-simplex facets, along with all rectified n-simplices. It can be thought of as an n-dimensional hypercubic honeycomb that has been subdivided along all hyperplanes , then stretched along its main diagonal until the simplices on the ends of the hypercubes become regular. The vertex figure of an n-simplex honeycomb is an expanded n-simplex.

In geometry of 4 dimensions or higher, a double pyramid, duopyramid, or fusil is a polytope constructed by 2 orthogonal polytopes with edges connecting all pairs of vertices between the two. The term fusil is used by Norman Johnson as a rhombic-shape. The term duopyramid was used by George Olshevsky, as the dual of a duoprism.

<span class="mw-page-title-main">3-4 duoprism</span>

In geometry of 4 dimensions, a 3-4 duoprism, the second smallest p-q duoprism, is a 4-polytope resulting from the Cartesian product of a triangle and a square.

References