Complex polytopeIn geometry, a complex polytope is a generalization of a polytope in real space to an analogous structure in a complex Hilbert space, where each real dimension is accompanied by an imaginary one. A complex polytope may be understood as a collection of complex points, lines, planes, and so on, where every point is the junction of multiple lines, every line of multiple planes, and so on. Precise definitions exist only for the regular complex polytopes, which are configurations.
N-skeletonIn mathematics, particularly in algebraic topology, the n-skeleton of a topological space X presented as a simplicial complex (resp. CW complex) refers to the subspace X_n that is the union of the simplices of X (resp. cells of X) of dimensions m ≤ n. In other words, given an inductive definition of a complex, the n-skeleton is obtained by stopping at the n-th step. These subspaces increase with n. The 0-skeleton is a discrete space, and the 1-skeleton a topological graph.
16-cellIn geometry, the 16-cell is the regular convex 4-polytope (four-dimensional analogue of a Platonic solid) with Schläfli symbol {3,3,4}. It is one of the six regular convex 4-polytopes first described by the Swiss mathematician Ludwig Schläfli in the mid-19th century. It is also called C16, hexadecachoron, or hexdecahedroid . It is a part of an infinite family of polytopes, called cross-polytopes or orthoplexes, and is analogous to the octahedron in three dimensions. It is Coxeter's polytope.
Surgery theoryIn mathematics, specifically in geometric topology, surgery theory is a collection of techniques used to produce one finite-dimensional manifold from another in a 'controlled' way, introduced by . Milnor called this technique surgery, while Andrew Wallace called it spherical modification. The "surgery" on a differentiable manifold M of dimension , could be described as removing an imbedded sphere of dimension p from M. Originally developed for differentiable (or, smooth) manifolds, surgery techniques also apply to piecewise linear (PL-) and topological manifolds.
Collapse: How Societies Choose to Fail or SucceedCollapse: How Societies Choose to Fail or Succeed (titled Collapse: How Societies Choose to Fail or Survive for the British edition) is a 2005 book by academic and popular science author Jared Diamond, in which the author first defines collapse: "a drastic decrease in human population size and/or political/economic/social complexity, over a considerable area, for an extended time.
Sperner's lemmaIn mathematics, Sperner's lemma is a combinatorial result on colorings of triangulations, analogous to the Brouwer fixed point theorem, which is equivalent to it. It states that every Sperner coloring (described below) of a triangulation of an -dimensional simplex contains a cell whose vertices all have different colors. The initial result of this kind was proved by Emanuel Sperner, in relation with proofs of invariance of domain.
Frobenius theorem (differential topology)In mathematics, Frobenius' theorem gives necessary and sufficient conditions for finding a maximal set of independent solutions of an overdetermined system of first-order homogeneous linear partial differential equations. In modern geometric terms, given a family of vector fields, the theorem gives necessary and sufficient integrability conditions for the existence of a foliation by maximal integral manifolds whose tangent bundles are spanned by the given vector fields.
Mutation (genetic algorithm)Mutation is a genetic operator used to maintain genetic diversity of the chromosomes of a population of a genetic or, more generally, an evolutionary algorithm (EA). It is analogous to biological mutation. The classic example of a mutation operator of a binary coded genetic algorithm (GA) involves a probability that an arbitrary bit in a genetic sequence will be flipped from its original state. A common method of implementing the mutation operator involves generating a random variable for each bit in a sequence.
