Search Results for ""

The shortest path-spanning tree from a graph vertex of a graph.

Informally, a situation in which a decision must be made from several alternatives, none of which is obviously the optimal one. In formal logic, a dilemma is a specific type ...

One of the Eilenberg-Steenrod axioms. Let X be a single point space. H_n(X)=0 unless n=0, in which case H_0(X)=G where G are some groups. The H_0 are called the coefficients ...

R^n is homeomorphic to R^m iff n=m. This theorem was first proved by Brouwer.

A diminished polyhedron is a polyhedron in which one or more groups of associated faces (such as those comprising the top of a pyramid or cupola in the case of a Johnson ...

Characterized by allowing only integer values.

A set S of positive integers is said to be Diophantine iff there exists a polynomial Q with integral coefficients in m>=1 indeterminates such that ...

The order-n dipole graph D_n is a multigraph consisting of two vertices and n multiple edges joining them. The dipole graph D_2 is a multigraph that can be considered to ...

Given the direct sum of additive Abelian groups A direct sum B, A and B are called direct summands. The map i_1:A-->A direct sum B defined by i(a)=a direct sum 0 is called ...

For {M_i}_(i in I) a family of R-modules indexed by a directed set I, let sigma_(ij):M_i->M_j i<=j be an R-module homomorphism. Call (M_i,sigma_(ij)) a direct system over I ...