Polytope


Also found in: Wikipedia.

polytope

[′päl·i‚tōp]
(mathematics)
A finite region in n-dimensional space (n = 2, 3, 4, …), enclosed by a finite number of hyperplanes; it is the n-dimensional analog of a polygon (n = 2) and a polyhedron (n = 3).

Polytope

 

(1) A polyhedron.

(2) A geometric figure that is the union of a finite number of convex polyhedrons of an arbitrary number of dimensions arbitrarily arranged in n-dimensional space. This concept is often made use of in topology and can easily be extended to the case of n-dimensional space.

Let us consider a half space in the n-dimensional space Rn that is, the set of all points located on one side of some in — 1)-dimensional hyperplane of the space along with the points of the hyperplane itself. Analytically, the half space is the set of all points of Rn whose coordinates satisfy a linear inequality of the form a1x1 + a2x2 + … + anxn + b ≥0. The intersection of a finite number of half spaces—if it is bounded— is the most general convex polyhedron of arbitrary dimension ≤ n located in Rn. A poly tope in the general sense of the word is the union of a finite number of such polyhedrons. When n = 2, we obtain two-dimensional polytopes, or polygons, which are not necessarily convex. One-dimensional polytopes are broken lines that need not be connected and may be branched—at any vertex any number of segments may meet. A zero-dimensional polytope is a finite set of points. A three-dimensional polytope can always be partitioned into polyhedrons of the simplest type —that is, into simplexes. Simplexes of dimension 0, 1, 2, and 3 correspond, respectively, to a point, a line segment, a triangle, and a tetrahedron, which is in general irregular. This partitioning, moreover, can be performed in such a way that either two of the resulting simplexes have no points in common or they share a face. Such partitions of a polytope into simplexes are called triangulations and constitute a fundamental research technique in combinatorial topology.

The concept of polytope permits of various generalizations. For example, curved polytopes are the images of polytopes under topological mappings; thus an arbitrary curved surface may be regarded as the topological image of a polyhedral surface. Another example is infinite polytope, which consists of an infinite set of convex polyhedrons (simplexes).

REFERENCES

Aleksandrov, P. S. Lektsii po analiticheskoi geometrii…. Moscow, 1968.
Aleksandrov, P. S. Kombinatornaia topologiia. Moscow-Leningrad, 1947.
Pontriagin, L. S. Osnovy kombinatornoi topologii. Moscow-Leningrad, 1947.
Aleksandrov, P. S., and B. A. Pasynkov. Vvedenie v teoriiu razmernosti. Moscow, 1973.

P. S. ALEKSANDROV

References in periodicals archive ?
Their topics include using a polytope model for unsupervised document summarization, rich feature spaces and regression models in single-document extractive summarization, a survey of neural models for abstractive summarization, headline generation as a sequence prediction with conditional random fields, and whether better summaries are also easier to understand: analyzing text complexity in automated summarization.
Schwartz relates these orbits to such topics as polytope exchange transformations, renormalization, continued fractions, corner percolation, and the Truchet tile system.
A small cover is a smooth closed manifold [M.sup.n] which admits a locally standard [Z.sup.n.sub.2]-action whose orbit space is a simple convex polytope.
Another way to construct Lyapunov functions with time-varying scheduled parameters is employing different Lyapunov functions at each of the vertices of the polytope LPV systems.
It is based on the premise that the composite limit state will form a convex polytope. It comprises two general steps.
In the following, a polytope is a homeomorphic image of a simplex.
where Z([sigma]) represents any matrix of the system in (34), [Z.sub.i], i = 1, ..., N, are the vertices, N is the number of vertices of the polytope, and [[LAMBDA].sub.N] is the unit simplex, given by
Furthermore, if each player in multiobjective bilevel problems chooses the worst-case weighted approach, then we show that the computation for robust-weighted Pareto optimum, with the choice of polytope weight set for every player, is reformulated as a solution to mathematical programing with equilibrium constraints (MPEC) which can be solved by the existing methods (e.g., the sequential quadratic programing (SQP) methods).
Consider a dimension n convex polytope [DELTA] [subset] [([R.sup.n]).sup.*].
For qudits (in odd dimension), only states lying outside the stabilizer polytope [28] manifest the negativity of the Wigner function and simultaneously violate the inequality (7) through appropriate two-qudit projectors; hence they display state-dependent contextuality [9, Theorem 1].
The PI has recently developed an approach to attack some problems in connection with the famous conjecture due to Fuglede (1974), concerning the characterization of domains which admit orthogonal Fourier bases in terms of their possibility to tile the space by translations, and in relation with the theory of multiple tiling by translates of a convex polytope, or by a function.
The stable set polytope denoted by CHSS is the convex hull of the incidence vectors of all stable sets of G.