Examples of using Polytopes in English and their translations into Spanish
{-}
-
Colloquial
-
Official
planes, polytopes(including parallel,
the fact that the face lattices of the primal and dual polyhedra or polytopes are themselves order-theoretic duals.
of the 4-dimensional regular polytopes.
Additionally, many computer scientists use the phrase“polyhedral combinatorics” to describe research into precise descriptions of the faces of certain specific polytopes(especially 0-1 polytopes, whose vertices are subsets of a hypercube)
affine map between the spaces that contain the two polytopes(not necessarily of the same dimension) which induces a bijection between the polytopes.
Duality of polytopes and order-theoretic duality are both involutions:
and by citing page 71 of the latter's Regular Polytopes to suggest where his A& B modules(depicted above) might enter the
but out of this research came Kepler's discoveries of the Kepler solids as regular polytopes, the realisation that the orbits of planets are not circles, and the laws of
only the square(and 1-dimensional line segment) are self-dual polytopes.
connected graphs graphs of diameter 2 and radius 1 directed acyclic graphs regular graphs bipartite graphs without non-trivial strongly regular subgraphs bipartite Eulerian graphs bipartite regular graphs line graphs split graphs chordal graphs regular self-complementary graphs polytopal graphs of general, simple, and simplicial convex polytopes in arbitrary dimensions.
representation of their cells: George Olshevsky advocates the term regiment for a set of polytopes that share an edge arrangement, and more generally n-regiment for a set of polytopes that share elements up to dimension n.
Mathematicians in this area study the combinatorics of polytopes; for instance, they seek inequalities that describe the relations between the numbers of vertices, edges, and faces of higher dimensions in arbitrary polytopes or in certain important subclasses of polytopes, and study other combinatorial properties of polytopes such as their connectivity and diameter number of steps needed to reach any vertex from any other vertex.
Duality can be generalized to n-dimensional space and dual polytopes;
more dimensions, only three regular polytopes exist.
Coxeter, whose research is a reference in the study of polytopes.
Descriptions of these may be found in the List of regular polytopes.
Two polytopes share the same vertex arrangement if they share the same 0-skeleton.
This observation has been generalised to higher dimensional dual polytopes.
In 4-dimensions, there are a large number of regular compounds of regular polytopes.
By definition, this isotopic property is common to the duals of the uniform polytopes.