|
10-orthoplex
In geometry, a 10-orthoplex or 10-cross polytope, is a regular 10-polytope with 20 vertices, 180 edges, 960 triangle faces, 3360 octahedron cells, 8064 5-cells ''4-faces'', 13440 ''5-faces'', 15360 ''6-faces'', 11520 ''7-faces'', 5120 ''8-faces'', and 1024 ''9-faces''. It has two constructed forms, the first being regular with Schläfli symbol , and the second with alternately labeled (checker-boarded) facets, with Schläfli symbol or Coxeter symbol 711. It is one of an infinite family of polytopes, called cross-polytopes or ''orthoplexes''. The dual polytope is the 10-hypercube or 10-cube. Alternate names *Decacross is derived from combining the family name ''cross polytope'' with ''deca'' for ten (dimensions) in Greek * Chilliaicositetraxennon as a 1024- facetted 10-polytope (polyxennon). Construction There are two Coxeter groups associated with the 10-orthoplex, one regular, dual of the 10-cube with the C10 or ,38symmetry group, and a lower symmetry with two copies of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
10-polytope
In ten-dimensional geometry, a 10-polytope is a 10-dimensional polytope whose boundary consists of 9-polytope facets, exactly two such facets meeting at each 8-polytope ridge. A uniform 10-polytope is one which is vertex-transitive, and constructed from uniform facets. Regular 10-polytopes Regular 10-polytopes can be represented by the Schläfli symbol , with x 9-polytope facets around each peak. There are exactly three such convex regular 10-polytopes: # - 10-simplex # - 10-cube # - 10-orthoplex There are no nonconvex regular 10-polytopes. Euler characteristic The topology of any given 10-polytope is defined by its Betti numbers and torsion coefficients.Richeson, D.; ''Euler's Gem: The Polyhedron Formula and the Birth of Topoplogy'', Princeton, 2008. The value of the Euler characteristic used to characterise polyhedra does not generalize usefully to higher dimensions, and is zero for all 10-polytopes, whatever their underlying topology. This inadequacy of the E ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
10-orthoplex
In geometry, a 10-orthoplex or 10-cross polytope, is a regular 10-polytope with 20 vertices, 180 edges, 960 triangle faces, 3360 octahedron cells, 8064 5-cells ''4-faces'', 13440 ''5-faces'', 15360 ''6-faces'', 11520 ''7-faces'', 5120 ''8-faces'', and 1024 ''9-faces''. It has two constructed forms, the first being regular with Schläfli symbol , and the second with alternately labeled (checker-boarded) facets, with Schläfli symbol or Coxeter symbol 711. It is one of an infinite family of polytopes, called cross-polytopes or ''orthoplexes''. The dual polytope is the 10-hypercube or 10-cube. Alternate names *Decacross is derived from combining the family name ''cross polytope'' with ''deca'' for ten (dimensions) in Greek * Chilliaicositetraxennon as a 1024- facetted 10-polytope (polyxennon). Construction There are two Coxeter groups associated with the 10-orthoplex, one regular, dual of the 10-cube with the C10 or ,38symmetry group, and a lower symmetry with two copies of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
10-cube
In geometry, a 10-cube is a ten-dimensional hypercube. It has 1024 vertices, 5120 edges, 11520 square faces, 15360 cubic cells, 13440 tesseract 4-faces, 8064 5-cube 5-faces, 3360 6-cube 6-faces, 960 7-cube 7-faces, 180 8-cube 8-faces, and 20 9-cube 9-faces. It can be named by its Schläfli symbol , being composed of 3 9-cubes around each 8-face. It is sometimes called a dekeract, a portmanteau of tesseract (the ''4-cube'') and ''deka-'' for ten (dimensions) in Greek, It can also be called an icosaxennon or icosa-10-tope as a 10 dimensional polytope, constructed from 20 regular facets. It is a part of an infinite family of polytopes, called hypercubes. The dual of a dekeract can be called a 10-orthoplex or decacross, and is a part of the infinite family of cross-polytopes. Cartesian coordinates Cartesian coordinates for the vertices of a dekeract centered at the origin and edge length 2 are : (±1,±1,±1,±1,±1,±1,±1,±1,±1,±1) while the interior of the same consis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cross Polytope
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. The vertices of a cross-polytope can be chosen as the unit vectors pointing along each co-ordinate axis – i.e. all the permutations of . The cross-polytope is the convex hull of its vertices. The ''n''-dimensional cross-polytope can also be defined as the closed unit ball (or, according to some authors, its boundary) in the ℓ1-norm on R''n'': :\. In 1 dimension the cross-polytope is simply the line segment minus;1, +1 in 2 dimensions it is a square (or diamond) with vertices . In 3 dimensions it is an octahedron—one of the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Orthoplex
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. The vertices of a cross-polytope can be chosen as the unit vectors pointing along each co-ordinate axis – i.e. all the permutations of . The cross-polytope is the convex hull of its vertices. The ''n''-dimensional cross-polytope can also be defined as the closed unit ball (or, according to some authors, its boundary) in the ℓ1-norm on R''n'': :\. In 1 dimension the cross-polytope is simply the line segment minus;1, +1 in 2 dimensions it is a square (or diamond) with vertices . In 3 dimensions it is an octahedron—one of the five ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
9-simplex
In geometry, a 9-simplex is a self-dual regular 9-polytope. It has 10 vertices, 45 edges, 120 triangle faces, 210 tetrahedral cells, 252 5-cell 4-faces, 210 5-simplex 5-faces, 120 6-simplex 6-faces, 45 7-simplex 7-faces, and 10 8-simplex 8-faces. Its dihedral angle is cos−1(1/9), or approximately 83.62°. It can also be called a decayotton, or deca-9-tope, as a 10- facetted polytope in 9-dimensions.. The name ''decayotton'' is derived from ''deca'' for ten facets in Greek and yotta (a variation of "oct" for eight), having 8-dimensional facets, and ''-on''. Coordinates The Cartesian coordinates of the vertices of an origin-centered regular decayotton having edge length 2 are: :\left(\sqrt,\ 1/6,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ \pm1\right) :\left(\sqrt,\ 1/6,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ -2\sqrt,\ 0\right) :\left(\sqrt,\ 1/6,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ -\sqrt,\ 0,\ 0\right) :\left(\sqrt,\ 1/6,\ \sqrt,\ \sqrt,\ \sqrt,\ -2\sqrt,\ 0,\ 0,\ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
9-simplex T0
In geometry, a 9-simplex is a self-dual regular 9-polytope. It has 10 vertices, 45 edges, 120 triangle faces, 210 tetrahedral cells, 252 5-cell 4-faces, 210 5-simplex 5-faces, 120 6-simplex 6-faces, 45 7-simplex 7-faces, and 10 8-simplex 8-faces. Its dihedral angle is cos−1(1/9), or approximately 83.62°. It can also be called a decayotton, or deca-9-tope, as a 10- facetted polytope in 9-dimensions.. The name ''decayotton'' is derived from ''deca'' for ten facets in Greek and yotta (a variation of "oct" for eight), having 8-dimensional facets, and ''-on''. Coordinates The Cartesian coordinates of the vertices of an origin-centered regular decayotton having edge length 2 are: :\left(\sqrt,\ 1/6,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ \pm1\right) :\left(\sqrt,\ 1/6,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ -2\sqrt,\ 0\right) :\left(\sqrt,\ 1/6,\ \sqrt,\ \sqrt,\ \sqrt,\ \sqrt,\ -\sqrt,\ 0,\ 0\right) :\left(\sqrt,\ 1/6,\ \sqrt,\ \sqrt,\ \sqrt,\ -2\sqrt,\ 0,\ 0,\ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Icosagon
In geometry, an icosagon or 20-gon is a twenty-sided polygon. The sum of any icosagon's interior angles is 3240 degrees. Regular icosagon The regular icosagon has Schläfli symbol , and can also be constructed as a truncated decagon, , or a twice-truncated pentagon, . One interior angle in a regular icosagon is 162°, meaning that one exterior angle would be 18°. The area of a regular icosagon with edge length is :A=t^2(1+\sqrt+\sqrt) \simeq 31.5687 t^2. In terms of the radius of its circumcircle, the area is :A=\frac(\sqrt-1); since the area of the circle is \pi R^2, the regular icosagon fills approximately 98.36% of its circumcircle. Uses The Big Wheel on the popular US game show ''The Price Is Right'' has an icosagonal cross-section. The Globe, the outdoor theater used by William Shakespeare's acting company, was discovered to have been built on an icosagonal foundation when a partial excavation was done in 1989. As a golygonal path, the swastika is considered to ... [...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] |
Geometry
Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is called a ''geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point, line, plane, distance, angle, surface, and curve, as fundamental concepts. During the 19th century several discoveries enlarged dramatically the scope of geometry. One of the oldest such discoveries is Carl Friedrich Gauss' ("remarkable theorem") that asserts roughly that the Gaussian curvature of a surface is independent from any specific embedding in a Euclidean space. This implies that surfaces can be studied ''intrinsically'', that is, as stand-alone spaces, and has been expanded into the theory of manifolds and Riemannian geometry. Later in the 19th century, it appeared that geometries ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hanner Polytope
In geometry, a Hanner polytope is a convex polytope constructed recursively by Cartesian product and polar dual operations. Hanner polytopes are named after Olof Hanner, who introduced them in 1956.. Construction The Hanner polytopes are constructed recursively by the following rules:. *A line segment is a one-dimensional Hanner polytope *The Cartesian product of every two Hanner polytopes is another Hanner polytope, whose dimension is the sum of the dimensions of the two given polytopes *The dual of a Hanner polytope is another Hanner polytope of the same dimension. They are exactly the polytopes that can be constructed using only these rules: that is, every Hanner polytope can be formed from line segments by a sequence of product and dual operations. Alternatively and equivalently to the polar dual operation, the Hanner polytopes may be constructed by Cartesian products and direct sums, the dual of the Cartesian products. This direct sum operation combines two polytopes by placin ... [...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] |
.jpg "Click for more on -> 3-simplex T0")
