|
Truncated 6-simplex
In six-dimensional geometry, a truncated 6-simplex is a convex uniform 6-polytope, being a truncation of the regular 6-simplex. There are unique 3 degrees of truncation. Vertices of the truncation 6-simplex are located as pairs on the edge of the 6-simplex. Vertices of the bitruncated 6-simplex are located on the triangular faces of the 6-simplex. Vertices of the tritruncated 6-simplex are located inside the tetrahedral cells of the 6-simplex. Truncated 6-simplex Alternate names * Truncated heptapeton (Acronym: til) (Jonathan Bowers) Coordinates The vertices of the ''truncated 6-simplex'' can be most simply positioned in 7-space as permutations of (0,0,0,0,0,1,2). This construction is based on facets of the truncated 7-orthoplex. Images Bitruncated 6-simplex Alternate names * Bitruncated heptapeton (Acronym: batal) (Jonathan Bowers) Coordinates The vertices of the ''bitruncated 6-simplex'' can be most simply positioned in 7-space as permutations of (0 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
6-simplex T0
In geometry, a 6-simplex is a Duality (mathematics), self-dual Regular polytope, regular 6-polytope. It has 7 vertex (geometry), vertices, 21 Edge (geometry), edges, 35 triangle Face (geometry), faces, 35 Tetrahedron, tetrahedral Cell (mathematics), cells, 21 5-cell 4-faces, and 7 5-simplex 5-faces. Its dihedral angle is cos−1(1/6), or approximately 80.41°. Alternate names It can also be called a heptapeton, or hepta-6-tope, as a 7-facet (geometry), facetted polytope in 6-dimensions. The 5-polytope#A note on generality of terms for n-polytopes and elements, name ''heptapeton'' is derived from ''hepta'' for seven Facet (mathematics), facets in Greek language, Greek and Peta-, ''-peta'' for having five-dimensional facets, and ''-on''. Jonathan Bowers gives a heptapeton the acronym hop. As a configuration This Regular 4-polytope#As configurations, configuration matrix represents the 6-simplex. The rows and columns correspond to vertices, edges, faces, cells, 4-faces and 5-face ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
5-simplex T01
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(), 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.'' Alternate names 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. As a configuration 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Polytope
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean space \mathbb^n. Most texts. use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others''Mathematical Programming'', by Melvyn W. Jeter (1986) p. 68/ref> (including this article) allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary. Convex polytopes play an important role both in various branches of mathematics and in applied areas, most notably in linear programming. In the influential textbooks of Grünbaum and Ziegler on the subject, as well as in many other texts in discrete geometry, convex polytopes are often simply called "polytopes". Grünbaum points out that this is solely to avoi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced in 1934 as abstractions of reflection groups , and finite Coxeter groups were classified in 1935 . Coxeter groups find applications in many areas of mathematics. Examples of finite Coxeter groups include the symmetry groups of regular polytopes, and the Weyl groups of simple Lie algebras. Examples of infinite Coxeter groups include the triangle groups corresponding to regular tessellations of the Euclidean plane and the hyperbolic plane, and the Weyl groups of infinite-dimensional Kac–Moody algebras. Standard ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Truncated 6-simplex Verf
Truncation is the term used for limiting the number of digits right of the decimal point by discarding the least significant ones. Truncation may also refer to: Mathematics * Truncation (statistics) refers to measurements which have been cut off at some value * Truncation (numerical analysis) refers to truncating an infinite sum by a finite one * Truncation (geometry) is the removal of one or more parts, as for example in truncated cube * Propositional truncation, a type former which truncates a type down to a mere proposition Computer science * Data truncation, an event that occurs when a file or other data is stored in a location too small to accommodate its entire length * Truncate (SQL), a command in the SQL data manipulation language to quickly remove all data from a table Biology * Truncate, a leaf shape * Truncated protein, a protein shortened by a mutation which specifically induces premature termination of messenger RNA translation Other uses * Cheque truncatio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex Figure
In geometry, a vertex figure, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off. Definitions Take some corner or Vertex (geometry), vertex of a polyhedron. Mark a point somewhere along each connected edge. Draw lines across the connected faces, joining adjacent points around the face. When done, these lines form a complete circuit, i.e. a polygon, around the vertex. This polygon is the vertex figure. More precise formal definitions can vary quite widely, according to circumstance. For example Coxeter (e.g. 1948, 1954) varies his definition as convenient for the current area of discussion. Most of the following definitions of a vertex figure apply equally well to infinite tessellation, tilings or, by extension, to Honeycomb (geometry), space-filling tessellation with polytope Cell (geometry), cells and other higher-dimensional polytopes. As a flat slice Make a slice through the corner of the polyhedron, cutting through all the edges ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hexagon
In geometry, a hexagon (from Ancient Greek, Greek , , meaning "six", and , , meaning "corner, angle") is a six-sided polygon. The total of the internal angles of any simple polygon, simple (non-self-intersecting) hexagon is 720°. Regular hexagon A ''regular polygon, regular hexagon'' has Schläfli symbol and can also be constructed as a Truncation (geometry), truncated equilateral triangle, t, which alternates two types of edges. A regular hexagon is defined as a hexagon that is both equilateral polygon, equilateral and equiangular polygon, equiangular. It is bicentric polygon, bicentric, meaning that it is both cyclic polygon, cyclic (has a circumscribed circle) and tangential polygon, tangential (has an inscribed circle). The common length of the sides equals the radius of the circumscribed circle or circumcircle, which equals \tfrac times the apothem (radius of the inscribed figure, inscribed circle). All internal angles are 120 degree (angle), degrees. A regular hexago ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangle
A triangle is a polygon with three Edge (geometry), edges and three Vertex (geometry), vertices. It is one of the basic shapes in geometry. A triangle with vertices ''A'', ''B'', and ''C'' is denoted \triangle ABC. In Euclidean geometry, any three points, when non-Collinearity, collinear, determine a unique triangle and simultaneously, a unique Plane (mathematics), plane (i.e. a two-dimensional Euclidean space). In other words, there is only one plane that contains that triangle, and every triangle is contained in some plane. If the entire geometry is only the Euclidean plane, there is only one plane and all triangles are contained in it; however, in higher-dimensional Euclidean spaces, this is no longer true. This article is about triangles in Euclidean geometry, and in particular, the Euclidean plane, except where otherwise noted. Types of triangle The terminology for categorizing triangles is more than two thousand years old, having been defined on the very first page of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
3-simplex T01
In geometry, a tetrahedron (plural: tetrahedra or tetrahedrons), also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners. The tetrahedron is the simplest of all the ordinary convex polyhedra and the only one that has fewer than 5 faces. The tetrahedron is the three-dimensional case of the more general concept of a Euclidean simplex, and may thus also be called a 3-simplex. The tetrahedron is one kind of pyramid, which is a polyhedron with a flat polygon base and triangular faces connecting the base to a common point. In the case of a tetrahedron the base is a triangle (any of the four faces can be considered the base), so a tetrahedron is also known as a "triangular pyramid". Like all convex polyhedra, a tetrahedron can be folded from a single sheet of paper. It has two such nets. For any tetrahedron there exists a sphere (called the circumsphere) on which all four vertices lie, and another sphere ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Truncated Tetrahedron
In geometry, the truncated tetrahedron is an Archimedean solid. It has 4 regular hexagonal faces, 4 equilateral triangle faces, 12 vertices and 18 edges (of two types). It can be constructed by truncating all 4 vertices of a regular tetrahedron at one third of the original edge length. A deeper truncation, removing a tetrahedron of half the original edge length from each vertex, is called rectification. The rectification of a tetrahedron produces an octahedron. A ''truncated tetrahedron'' is the Goldberg polyhedron containing triangular and hexagonal faces. A ''truncated tetrahedron'' can be called a cantic cube, with Coxeter diagram, , having half of the vertices of the cantellated cube (rhombicuboctahedron), . There are two dual positions of this construction, and combining them creates the uniform compound of two truncated tetrahedra. Area and volume The area ''A'' and the volume ''V'' of a truncated tetrahedron of edge length ''a'' are: :\begin A &= 7\sqrta^2 &&\appro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
3-simplex T0
In geometry, a tetrahedron (plural: tetrahedra or tetrahedrons), also known as a triangular Pyramid (geometry), pyramid, is a polyhedron composed of four triangular Face (geometry), faces, six straight Edge (geometry), edges, and four vertex (geometry), vertex corners. The tetrahedron is the simplest of all the ordinary convex polytope, convex polyhedra and the only one that has fewer than 5 faces. The tetrahedron is the three-dimensional case of the more general concept of a Euclidean geometry, Euclidean simplex, and may thus also be called a 3-simplex. The tetrahedron is one kind of pyramid (geometry), pyramid, which is a polyhedron with a flat polygon base and triangular faces connecting the base to a common point. In the case of a tetrahedron the base is a triangle (any of the four faces can be considered the base), so a tetrahedron is also known as a "triangular pyramid". Like all convex polyhedra, a tetrahedron can be folded from a single sheet of paper. It has two such ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
4-simplex T01
In geometry, the 5-cell is the convex 4-polytope with Schläfli symbol . It is a 5-vertex four-dimensional object bounded by five tetrahedral cells. It is also known as a C5, pentachoron, pentatope, pentahedroid, or tetrahedral pyramid. It is the 4-simplex (Coxeter's \alpha_4 polytope), the simplest possible convex 4-polytope, and is analogous to the tetrahedron in three dimensions and the triangle in two dimensions. The 5-cell is a 4-dimensional pyramid with a tetrahedral base and four tetrahedral sides. The regular 5-cell is bounded by five regular tetrahedra, and is one of the six regular convex 4-polytopes (the four-dimensional analogues of the Platonic solids). A regular 5-cell can be constructed from a regular tetrahedron by adding a fifth vertex one edge length distant from all the vertices of the tetrahedron. This cannot be done in 3-dimensional space. The regular 5-cell is a solution to the problem: ''Make 10 equilateral triangles, all of the same size, using 10 mat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> 3-simplex T01")
