Search Results for ""

Let X be a normed space, M and N be algebraically complemented subspaces of X (i.e., M+N=X and M intersection N={0}), pi:X->X/M be the quotient map, phi:M×N->X be the natural ...

A completely positive matrix is a real n×n square matrix A=(a_(ij)) that can be factorized as A=BB^(T), where B^(T) stands for the transpose of B and B is any (not ...

A series is said to be conditionally convergent iff it is convergent, the series of its positive terms diverges to positive infinity, and the series of its negative terms ...

A strongly regular graph with parameters (n,k,a,c) has graph eigenvalues k, theta, and tau, where theta = ((a-c)+sqrt(Delta))/2 (1) tau = ((a-c)-sqrt(Delta))/2 (2) where ...

A contravariant tensor is a tensor having specific transformation properties (cf., a covariant tensor). To examine the transformation properties of a contravariant tensor, ...

A copositive matrix is a real n×n square matrix A=(a_(ij)) that makes the corresponding quadratic form f(x)=x^(T)Ax nonnegative for all nonnegative n-vectors x. Copositive ...

A covariant tensor, denoted with a lowered index (e.g., a_mu) is a tensor having specific transformation properties. In general, these transformation properties differ from ...

The cross polytope beta_n is the regular polytope in n dimensions corresponding to the convex hull of the points formed by permuting the coordinates (+/-1, 0, 0, ..., 0). A ...

A general system of fourth-order curvilinear coordinates based on the cyclide in which Laplace's equation is separable (either simply separable or R-separable). Bôcher (1894) ...

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...