Examples of using Polytope in English and their translations into Russian
{-}
-
Official
-
Colloquial
This is possibly the simplest such polytope.
A polytope in eight dimensions is called an 8-polytope.
Instead, the 11-cell is a locally projective polytope.
A polytope having this property is said to be atomistic.
Are self-dual(p=r and a=b),while 14 exist as dual polytope pairs.
Such a polytope is named hemi-{p, q and contain half as many elements.
A diagram needs at least one active node to represent a polytope.
A polytope is then defined as a set of faces P with an order relation.
A tessellation of an n-dimensional manifold is actually a rank n+ 1 polytope.
A polytope or tiling may be called k-isogonal if its vertices form k transitivity classes.
The family was named by H. S. M. Coxeter,because the two-dimensional pentagonal polytope is a pentagon.
The simplest irregular polytope is the square pyramid, though this still has many symmetries.
It can be shown from the axioms that every section is a polytope, and that Rank(G/F) Rank(G)- Rank(F)- 1.
A polytope that is the subset of another polytope is not necessarily a section.
The Birkhoff-von Neumann theorem states that this polytope can be described by two types of linear inequality or equality.
See also polytope families for a table of end-node uniform polytopes associated with these groups.
The 1-skeleton of any k-dimensional convex polytope forms a k-vertex-connected graph Balinski's theorem, Balinski 1961.
A polytope may be regarded as regular if, and only if, its symmetry group is transitive on its flags.
One method of forming the Kleetope of a polytope P is to place a new vertex outside P, near the centroid of each facet.
A polytope is the n-dimensional analogue of a 3-dimensional polyhedron, the values being calculated in this case are scattering amplitudes, and so the object is called an amplituhedron.
If L is, instead, also a square,the universal polytope{K, L}(that is,{4,4}) is the tessellation of the Euclidean plane by squares.
Such a polytope can be obtained from a tetrahedron by repeatedly gluing additional tetrahedra one at a time onto its triangular faces.
In geometry of 4 dimensions or higher,duoprism is a polytope resulting from the Cartesian product of two polytopes, each of two dimensions or higher.
If the polytope is convex, a point near the facet will exist which maps the facet outside, and all other facets inside, so no edges need to cross in the projection.
That is, rather than restricting K and L to be particular polytopes,they are allowed to be any polytope with a given topology, that is, any polytope tessellating a given manifold.
Abstract polytope Combinatorial commutative algebra Matroid polytope Simplicial sphere Ziegler(1995), pp. 51.
The rank of a face or polytope usually corresponds to the dimension of its counterpart in traditional theory.
More generally, a polytope in n-dimensions has a Schegel diagram constructed by a perspective projection viewed from a point outside of the polytope, above the center of a facet.
By this definition, a polytope that lacks any symmetry at all would be an example of a chiral polytope. .
The Birkhoff polytope is a special case of the transportation polytope, a polytope of nonnegative rectangular matrices with given row and column sums.