related topics
{math, number, function}
{math, energy, light}
{line, north, south}
{household, population, female}
{style, bgcolor, rowspan}

In geometry, a simplex (plural simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimension. Specifically, an n-simplex is an n-dimensional polytope which is the convex hull of its n + 1 vertices. For example, a 2-simplex is a triangle, a 3-simplex is a tetrahedron, and a 4-simplex is a pentachoron. A single point may be considered a 0-simplex, and a line segment may be considered a 1-simplex. A simplex may be defined as the smallest convex set containing the given vertices.

A regular simplex[1] is a simplex that is also a regular polytope. A regular n-simplex may be constructed from a regular (n − 1)-simplex by connecting a new vertex to all original vertices by the common edge length.

In topology and combinatorics, it is common to “glue together” simplices to form a simplicial complex. The associated combinatorial structure is called an abstract simplicial complex, in which context the word “simplex” simply means any finite set of vertices.


Full article ▸

related documents
Proofs of Fermat's little theorem
Absolute value
Interval (mathematics)
Hash function
Frame problem
Compass and straightedge constructions
Group action
Prime number theorem
Huffman coding
Abelian group
Dynamic programming
Multivariate normal distribution
Computable number
Lua (programming language)
Fundamental group
Central limit theorem
Hyperreal number
Gaussian elimination
Cardinal number
Kernel (algebra)
Continuous function
Primitive recursive function
Euler's formula
Dual space
Bessel function
Sequence alignment
Fundamental theorem of algebra