Search Results for ""

A tree not having the complete bipartite graph K_(1,2) with base at the vertex of degree two as a limb (Lu et al. 1993, Lu 1996).

A set of maximum degree to which all other degrees of recursively enumerable sets can be many-one reduced. If set A is many-one complete, then it is one-one complete, and ...

A stable fixed point of a map which, in a dissipative dynamical system, is an attractor.

Let Y^X be the set of continuous mappings f:X->Y. Then the topological space for Y^X supplied with a compact-open topology is called a mapping space.

A sequence X_1, X_2, ... of random variates is called Markov (or Markoff) if, for any n, F(X_n|X_(n-1),X_(n-2),...,X_1)=F(X_n|X_(n-1)), i.e., if the conditional distribution ...

A set of vectors is maximally linearly independent if including any other vector in the vector space would make it linearly dependent (i.e., if any other vector in the space ...

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...

Let (X,A,mu) and (Y,B,nu) be measure spaces. A measurable rectangle is a set of the form A×B for A in A and B in B.

A set of points capable of being enclosed in intervals whose total length is arbitrarily small.

A median triangle is a triangle whose sides are equal and parallel to the medians of a given triangle. The median triangle of the median triangle is similar to the given ...