Search Results for ""

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

A topology induced by the metric g defined on a metric space X. The open sets are all subsets that can be realized as the unions of open balls B(x_0,r)={x in X|g(x_0,x)<r}, ...

Model completion is a term employed when existential closure is successful. The formation of the complex numbers, and the move from affine to projective geometry, are ...

A lattice which satisfies the identity (x ^ y) v (x ^ z)=x ^ (y v (x ^ z)) is said to be modular.

Let M be a sigma-algebra M, and let lambda_1 and lambda_2 be measures on M. If there exists a pair of disjoint sets A and B such that lambda_1 is concentrated on A and ...

An ideal I of a partial order P is a subset of the elements of P which satisfy the property that if y in I and x<y, then x in I. For k disjoint chains in which the ith chain ...

For a partial order, the size of the longest chain is called the length.

For a partial order, the size of the longest antichain is called the width.

A topological space X is pathwise-connected iff for every two points x,y in X, there is a continuous function f from [0,1] to X such that f(0)=x and f(1)=y. Roughly speaking, ...