Search Results for ""

A curve is simple if it does not cross itself.

Interest which is paid only on the principal and not on the additional amount generated by previous interest payments. A formula for computing simple interest is ...

A simple path is a path which is a simple curve. More precisely, a continuous mapping gamma:[a,b]->C^0 is a simple path if it has no self-intersections. Here, C^0 denotes the ...

A nonzero ring S whose only (two-sided) ideals are S itself and zero. Every commutative simple ring is a field. Every simple ring is a prime ring.

The set St^_v-Stv, where St^_v is a closed star and Stv is a star, is called the link of v in a simplicial complex K and is denoted Lkv (Munkres 1993, p. 11).

Let f:K^((0))->L^((0)) be a bijective correspondence such that the vertices v_0, ..., v_n of K span a simplex of K iff f(v_0), ..., f(v_n) span a simplex of L. Then the ...

Let K and L be simplicial complexes, and let f:K^((0))->L^((0)) be a map. Suppose that whenever the vertices v_0, ..., v_n of K span a simplex of K, the points f(v_0), ..., ...

If L is a subcollection of a simplicial complex K that contains all faces of its elements, then L is another simplicial complex called a simplicial subcomplex.

The number of operations needed to effect a geometric construction as determined in geometrography. If the number of operations of the five geometrographic types are denoted ...

The Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).