|
1 33 Honeycomb
In 7-dimensional geometry, 133 is a uniform honeycomb, also given by Schläfli symbol , and is composed of 132 facets. Construction It is created by a Wythoff construction upon a set of 8 hyperplane mirrors in 7-dimensional space. The facet information can be extracted from its Coxeter-Dynkin diagram. : Removing a node on the end of one of the 3-length branch leaves the 132, its only facet type. : The vertex figure is determined by removing the ringed node and ringing the neighboring node. This makes the trirectified 7-simplex, 033. : The edge figure is determined by removing the ringed nodes of the vertex figure and ringing the neighboring node. This makes the tetrahedral duoprism, ×. : Kissing number Each vertex of this polytope corresponds to the center of a 6-sphere in a moderately dense sphere packing, in which each sphere is tangent to 70 others; the best known for 7 dimensions (the kissing number) is 126. Geometric folding The _7 group is re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform 8-polytope
In Eight-dimensional space, eight-dimensional geometry, an eight-dimensional polytope or 8-polytope is a polytope contained by 7-polytope facets. Each 6-polytope Ridge (geometry), ridge being shared by exactly two 7-polytope Facet (mathematics), facets. A uniform 8-polytope is one which is vertex-transitive, and constructed from uniform 7-polytope facets. Regular 8-polytopes Regular 8-polytopes can be represented by the Schläfli symbol , with v 7-polytope Facet (mathematics), facets around each Peak (geometry), peak. There are exactly three such List of regular polytopes#Convex 4, convex regular 8-polytopes: # - 8-simplex # - 8-cube # - 8-orthoplex There are no nonconvex regular 8-polytopes. Characteristics The topology of any given 8-polytope is defined by its Betti numbers and torsion coefficient (topology), torsion coefficients.Richeson, D.; ''Euler's Gem: The Polyhedron Formula and the Birth of Topoplogy'', Princeton, 2008. The value of the Euler characteristic u ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
4-simplex T0
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 ma ... [...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] |
7-simplex T3
In 7-dimensional geometry, a 7-simplex is a self-dual regular 7-polytope. It has 8 vertices, 28 edges, 56 triangle faces, 70 tetrahedral cells, 56 5-cell 5-faces, 28 5-simplex 6-faces, and 8 6-simplex 7-faces. Its dihedral angle is cos−1(1/7), or approximately 81.79°. Alternate names It can also be called an octaexon, or octa-7-tope, as an 8- facetted polytope in 7-dimensions. The name A name is a term used for identification by an external observer. They can identify a class or category of things, or a single thing, either uniquely, or within a given context. The entity identified by a name is called its referent. A personal ... ''octaexon'' is derived from ''octa'' for eight facets in Greek and ''-ex'' for having six-dimensional facets, and ''-on''. Jonathan Bowers gives an octaexon the acronym oca. As a configuration This configuration matrix represents the 7-simplex. The rows and columns correspond to vertices, edges, faces, cells, 4-faces, 5-faces and 6- ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trirectified 7-simplex
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''. Rectified 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. Alternate names * Rectified octaexon (Acronym: roc) (Jonathan Bowers) Coordinates 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 c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tetrahedral
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] |
3-3 Duoprism
In the geometry of 4 dimensions, the 3-3 duoprism or triangular duoprism is a 4-polytope, 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. It has 9 vertices, 18 edges, 15 faces (9 squares, and 6 triangles), in 6 triangular prism cells. It has Coxeter diagram , and symmetry , order 72. Its vertices and edges form a 3\times 3 rook's graph. Hypervolume The hypervolume of a Uniform_4-polytope#Duoprisms:_.5Bp.5D_.C3.97_.5Bq.5D, uniform 3-3 duoprism, with edge length ''a'', is V_4 = a^4. This is the square of the Equilateral_triangle#Principal_properties, area of an equilateral triangle, A = a^2. 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Duoprism
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 -polytope and an -polytope is an -polytope, where and are dimensions of 2 (polygon) or higher. The lowest-dimensional duoprisms exist in 4-dimensional space as 4-polytopes being the Cartesian product of two polygons in 2-dimensional Euclidean space. More precisely, it is the set of points: :P_1 \times P_2 = \ where and are the sets of the points contained in the respective polygons. Such a duoprism is convex if both bases are convex, and is bounded by prismatic cells. Nomenclature Four-dimensional duoprisms are considered to be prismatic 4-polytopes. A duoprism constructed from two regular polygons of the same edge length is a uniform duoprism. A duoprism made of ''n''-polygons and ''m''-polygons is named by prefixing 'duoprism' with the names of the base polygons, for examp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangular
A triangle is a polygon with three edges and three 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- collinear, determine a unique triangle and simultaneously, a unique 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 Euclid's Elements. The names used for modern classification are ei ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square (geometry)
In Euclidean geometry, a square is a regular quadrilateral, which means that it has four equal sides and four equal angles (90-degree angles, π/2 radian angles, or right angles). It can also be defined as a rectangle with two equal-length adjacent sides. It is the only regular polygon whose internal angle, central angle, and external angle are all equal (90°), and whose diagonals are all equal in length. A square with vertices ''ABCD'' would be denoted . Characterizations A convex quadrilateral is a square if and only if it is any one of the following: * A rectangle with two adjacent equal sides * A rhombus with a right vertex angle * A rhombus with all angles equal * A parallelogram with one right vertex angle and two adjacent equal sides * A quadrilateral with four equal sides and four right angles * A quadrilateral where the diagonals are equal, and are the perpendicular bisectors of each other (i.e., a rhombus with equal diagonals) * A convex quadrilateral with successiv ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Tetrahedral")
