Search Results for ""

A figurate number Te_n of the form Te_n = sum_(k=1)^(n)T_k (1) = 1/6n(n+1)(n+2) (2) = (n+2; 3), (3) where T_k is the kth triangular number and (n; m) is a binomial ...

Given a complex Hilbert space H with associated space L(H) of continuous linear operators from H to itself, the bicommutant M^('') of an arbitrary subset M subset= L(H) is ...

Given a complex Hilbert space H with associated space L(H) of continuous linear operators from H to itself, the commutant M^' of an arbitrary subset M subset= L(H) is the ...

Let X and Y be sets, and let R subset= X×Y be a relation on X×Y. Then R is a concurrent relation if and only if for any finite subset F of X, there exists a single element p ...

Given a subset S subset R^n and a point x in S, the contingent cone K_S(x) at x with respect to S is defined to be the set K_S(x)={h:d_S^-(x;h)=0} where d_S^- is the upper ...

A fibered category F over a topological space X consists of 1. a category F(U) for each open subset U subset= X, 2. a functor i^*:F(U)->F(V) for each inclusion i:V↪U, and 3. ...

Let F and G be fibered categories over a topological space X. A morphism phi:F->G of fibered categories consists of: 1. a functor phi(U):F->G(U) for each open subset U ...

A subset G subset R of the real numbers is said to be a G_delta set provided G is the countable intersection of open sets. The name G_delta comes from German: The G stands ...

Given a subset S subset R^n and a real function f which is Gâteaux differentiable at a point x in S, f is said to be pseudoconvex at x if del f(x)·(y-x)>=0,y in ...

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...