|
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,\ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
9-polytope
In nine-dimensional geometry, a nine-dimensional polytope or 9-polytope is a polytope contained by 8-polytope facets. Each 7-polytope ridge being shared by exactly two 8-polytope facets. A uniform 9-polytope is one which is vertex-transitive, and constructed from uniform 8-polytope facets. Regular 9-polytopes Regular 9-polytopes can be represented by the Schläfli symbol , with w 8-polytope facets around each peak. There are exactly three such convex regular 9-polytopes: # - 9-simplex # - 9-cube # - 9-orthoplex There are no nonconvex regular 9-polytopes. Euler characteristic The topology of any given 9-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, whatever their underlying topology. This inadequacy of the Euler characteristic t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simplex
In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. For example, * a 0-dimensional simplex is a point, * a 1-dimensional simplex is a line segment, * a 2-dimensional simplex is a triangle, * a 3-dimensional simplex is a tetrahedron, and * a 4-dimensional simplex is a 5-cell. Specifically, a ''k''-simplex is a ''k''-dimensional polytope which is the convex hull of its ''k'' + 1 vertices. More formally, suppose the ''k'' + 1 points u_0, \dots, u_k \in \mathbb^ are affinely independent, which means u_1 - u_0,\dots, u_k-u_0 are linearly independent. Then, the simplex determined by them is the set of points : C = \left\ This representation in terms of weighted vertices is known as the barycentric coordinate system. A regular simplex is a simplex that is also a regular poly ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
9-simplex T0
In geometry, a 9-simplex is a self-dual Regular polytope, regular 9-polytope. It has 10 vertex (geometry), vertices, 45 Edge (geometry), edges, 120 triangle Face (geometry), faces, 210 tetrahedral Cell (mathematics), 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-facet (geometry), facetted polytope in 9-dimensions.. The 5-polytope#A note on generality of terms for n-polytopes and elements, name ''decayotton'' is derived from ''deca'' for ten Facet (mathematics), facets in Greek language, 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) :\l ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Decagon
In geometry, a decagon (from the Greek δέκα ''déka'' and γωνία ''gonía,'' "ten angles") is a ten-sided polygon or 10-gon.. The total sum of the interior angles of a simple decagon is 1440°. A self-intersecting ''regular decagon'' is known as a decagram. Regular decagon A '' regular decagon'' has all sides of equal length and each internal angle will always be equal to 144°. Its Schläfli symbol is and can also be constructed as a truncated pentagon, t, a quasiregular decagon alternating two types of edges. Side length The picture shows a regular decagon with side length a and radius R of the circumscribed circle. * The triangle E_E_1M has to equally long legs with length R and a base with length a * The circle around E_1 with radius a intersects ]M\,E_ _in_a_point_P_(not_designated_in_the_picture)._ *_Now_the_triangle_\;_is_a_isosceles_triangle.html" ;"title="/math> in a point P (not designated in the picture). * Now the triangle \; is a isosceles triang ... [...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, 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Face (geometry)
In solid geometry, a face is a flat surface (a planar region) that forms part of the boundary of a solid object; a three-dimensional solid bounded exclusively by faces is a ''polyhedron''. In more technical treatments of the geometry of polyhedra and higher-dimensional polytopes, the term is also used to mean an element of any dimension of a more general polytope (in any number of dimensions).. Polygonal face In elementary geometry, a face is a polygon on the boundary of a polyhedron. Other names for a polygonal face include polyhedron side and Euclidean plane ''tile''. For example, any of the six squares that bound a cube is a face of the cube. Sometimes "face" is also used to refer to the 2-dimensional features of a 4-polytope. With this meaning, the 4-dimensional tesseract has 24 square faces, each sharing two of 8 cubic cells. Number of polygonal faces of a polyhedron Any convex polyhedron's surface has Euler characteristic :V - E + F = 2, where ''V'' is the num ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Edge (geometry)
In geometry, an edge is a particular type of line segment joining two vertices in a polygon, polyhedron, or higher-dimensional polytope. In a polygon, an edge is a line segment on the boundary, and is often called a polygon side. In a polyhedron or more generally a polytope, an edge is a line segment where two faces (or polyhedron sides) meet. A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called a diagonal. Relation to edges in graphs In graph theory, an edge is an abstract object connecting two graph vertices, unlike polygon and polyhedron edges which have a concrete geometric representation as a line segment. However, any polyhedron can be represented by its skeleton or edge-skeleton, a graph whose vertices are the geometric vertices of the polyhedron and whose edges correspond to the geometric edges. Conversely, the graphs that are skeletons of three-dimensional polyhedra can be characterized by Steinitz's the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex (geometry)
In geometry, a vertex (in plural form: vertices or vertexes) is a point where two or more curves, lines, or edges meet. As a consequence of this definition, the point where two lines meet to form an angle and the corners of polygons and polyhedra are vertices. Definition Of an angle The ''vertex'' of an angle is the point where two rays begin or meet, where two line segments join or meet, where two lines intersect (cross), or any appropriate combination of rays, segments, and lines that result in two straight "sides" meeting at one place. :(3 vols.): (vol. 1), (vol. 2), (vol. 3). Of a polytope A vertex is a corner point of a polygon, polyhedron, or other higher-dimensional polytope, formed by the intersection of edges, faces or facets of the object. In a polygon, a vertex is called " convex" if the internal angle of the polygon (i.e., the angle formed by the two edges at the vertex with the polygon inside the angle) is less than π radians (180°, two right angles); ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Polytope
In mathematics, a regular polytope is a polytope whose symmetry group acts transitively on its flags, thus giving it the highest degree of symmetry. All its elements or -faces (for all , where is the dimension of the polytope) — cells, faces and so on — are also transitive on the symmetries of the polytope, and are regular polytopes of dimension . Regular polytopes are the generalized analog in any number of dimensions of regular polygons (for example, the square or the regular pentagon) and regular polyhedra (for example, the cube). The strong symmetry of the regular polytopes gives them an aesthetic quality that interests both non-mathematicians and mathematicians. Classically, a regular polytope in dimensions may be defined as having regular facets (-faces) and regular vertex figures. These two conditions are sufficient to ensure that all faces are alike and all vertices are alike. Note, however, that this definition does not work for abstract polytopes. A ... [...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 ... [...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 avo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Self-dual Polytope
In geometry, every polyhedron is associated with a second dual structure, where the vertices of one correspond to the faces of the other, and the edges between pairs of vertices of one correspond to the edges between pairs of faces of the other. Such dual figures remain combinatorial or abstract polyhedra, but not all can also be constructed as geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron. Duality preserves the symmetries of a polyhedron. Therefore, for many classes of polyhedra defined by their symmetries, the duals belong to a corresponding symmetry class. For example, the regular polyhedrathe (convex) Platonic solids and (star) Kepler–Poinsot polyhedraform dual pairs, where the regular tetrahedron is self-dual. The dual of an isogonal polyhedron (one in which any two vertices are equivalent under symmetries of the polyhedron) is an isohedral polyhedron (one in which any two faces are equivalent .., and vice v ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> 3-simplex T0")
