Search Results for ""

A map projection. The inverse equations for phi are computed by iteration. Let the angle of the projection plane be theta_b. Define a={0 for theta_b=1/2pi; ...

The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...

Eigenvectors are a special set of vectors associated with a linear system of equations (i.e., a matrix equation) that are sometimes also known as characteristic vectors, ...

The axiom of Zermelo-Fraenkel set theory which asserts that sets formed by the same elements are equal, forall x(x in a=x in b)=>a=b. Note that some texts (e.g., Devlin ...

A subset tau in S_n of a permutation {1,...,n} is said to contain alpha in S_k if there exist 1<=i_1<...<i_k<=n such that tau=(tau_i,...,tau_k) is order isomorphic to ...

For any function f:A->B (where A and B are any sets), the kernel (also called the null space) is defined by Ker(f)={x:x in Asuch thatf(x)=0}, so the kernel gives the elements ...

An abstract simplicial complex is a collection S of finite nonempty sets such that if A is an element of S, then so is every nonempty subset of A (Munkres 1993, p. 15).

A weakened version of pointwise convergence hypothesis which states that, for X a measure space, f_n(x)->f(x) for all x in Y, where Y is a measurable subset of X such that ...

A Banach space X has the approximation property (AP) if, for every epsilon>0 and each compact subset K of X, there is a finite rank operator T in X such that for each x in K, ...

For any set theoretic formula f(x,t_1,t_2,...,t_n), In other words, for any formula and set A there is a subset of A consisting exactly of those elements which satisfy the ...