Abstract polytope

In mathematics, an abstract polytope is an algebraic partially ordered set which captures the dyadic property of a traditional polytope without specifying purely geometric properties such as points and lines. A geometric polytope is said to be a realization of an abstract polytope in some real N-dimensional space, typically Euclidean. This abstract definition allows more general combinatorial structures than traditional definitions of a polytope, thus allowing new objects that have no counterpart in traditional theory. In Euclidean geometry, two shapes that are not similar can nonetheless share a common structure. For example, a square and a trapezoid both comprise an alternating chain of four vertices and four sides, which makes them quadrilaterals. They are said to be isomorphic or “structure preserving”. This common structure may be represented in an underlying abstract polytope, a purely algebraic partially ordered set which captures the pattern of connections (or incidences) between the various structural elements. The measurable properties of traditional polytopes such as angles, edge-lengths, skewness, straightness and convexity have no meaning for an abstract polytope. What is true for traditional polytopes (also called classical or geometric polytopes) may not be so for abstract ones, and vice versa. For example, a traditional polytope is regular if all its facets and vertex figures are regular, but this is not necessarily so for an abstract polytope. A traditional polytope is said to be a realization of the associated abstract polytope. A realization is a mapping or injection of the abstract object into a real space, typically Euclidean, to construct a traditional polytope as a real geometric figure. The six quadrilaterals shown are all distinct realizations of the abstract quadrilateral, each with different geometric properties. Some of them do not conform to traditional definitions of a quadrilateral and are said to be unfaithful realizations. A conventional polytope is a faithful realization.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (46)

Related courses (1)

Related lectures (15)

MATH-563: Student seminar in pure mathematics

In this seminar we will study toric varieties, a well studied class of algebraic varieties which is ubiquitous in algebraic geometry, but also relevant in theoretical physics and combinatorics.

In geometry, a uniform polyhedron has regular polygons as faces and is vertex-transitive (i.e., there is an isometry mapping any vertex onto any other). It follows that all vertices are congruent. Uniform polyhedra may be regular (if also face- and edge-transitive), quasi-regular (if also edge-transitive but not face-transitive), or semi-regular (if neither edge- nor face-transitive). The faces and vertices need not be convex, so many of the uniform polyhedra are also star polyhedra.

In mathematics, the 11-cell is a self-dual abstract regular 4-polytope (four-dimensional polytope). Its 11 cells are hemi-icosahedral. It has 11 vertices, 55 edges and 55 faces. It has Schläfli type {3,5,3}, with 3 hemi-icosahedra (Schläfli type {3,5}) around each edge. It has symmetry order 660, computed as the product of the number of cells (11) and the symmetry of each cell (60). The symmetry structure is the abstract group projective special linear group L2(11).

Closest Vector Problem: Voronoi Cells MATH-504: Integer optimisation

Explores the closest vector problem in lattices and the role of Voronoi cells in determining the closest vector.

Vectorworks Educational Version

Introduces Vectorworks Educational Version for architectural drawings, covering tools, layers, and annotations.

Linear Inequalities and Equivalent LP MATH-261: Discrete optimization

Covers linear inequalities, active constraints, and equivalent linear programs.