finite polytope
Смотреть что такое "finite polytope" в других словарях:
Polytope — Not to be confused with polytrope. In elementary geometry, a polytope is a geometric object with flat sides, which exists in any general number of dimensions. A polygon is a polytope in two dimensions, a polyhedron in three dimensions, and so on… … Wikipedia
polytope — noun A finite region of n dimensional space bounded by hyperplanes; the geometrical entity represented by the general term of the infinite sequence point, line, polygon, polyhedron … Wiktionary
Convex polytope — A 3 dimensional convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n dimensional space Rn.[1] Some authors use the terms convex polytope and convex… … Wikipedia
Abstract polytope — In mathematics, an abstract polytope is a combinatorial structure with properties similar to those shared by a more classical polytope. Abstract polytopes correspond to the structures of polygons, polyhedra, tessellations of the plane and higher… … Wikipedia
Uniform polytope — A uniform polytope is a vertex transitive polytope made from uniform polytope facets. A uniform polytope must also have only regular polygon faces.Uniformity is a generalization of the older category semiregular, but also includes the regular… … Wikipedia
Gosset 4 21 polytope — The Gosset 421 polytope is an 8 dimensional semiregular uniform polytope composed of 17,280 7 simplex and 2,160 7 orthoplex facets.It was discovered by Thorold Gosset, who described it in his 1900 paper as an 8 ic semi regular figure. It is the… … Wikipedia
Neighborly polytope — In geometry and polyhedral combinatorics, a k neighborly polytope is a convex polytope in which every set of k or fewer vertices forms a face. For instance, a 2 neighborly polytope is a polytope in which every pair of vertices is connected by an… … Wikipedia
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 mirror symmetries. Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry … Wikipedia
Duality (mathematics) — In mathematics, a duality, generally speaking, translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one to one fashion, often (but not always) by means of an involution operation: if the dual… … Wikipedia
Coxeter–Dynkin diagram — See also: Dynkin diagram Coxeter Dynkin diagrams for the fundamental finite Coxeter groups … Wikipedia
Polyhedron — Polyhedra redirects here. For the relational database system, see Polyhedra DBMS. For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). Some Polyhedra Dodecahedron (Regular polyhedron) … Wikipedia
