Search Results for ""

Let A and B be C^*-algebras, then a linear map phi:A->B is said to be positive if phi(A_+) subset= B_+. Here, A_+ is denoted the positive part of A. For example, every ...

A data structure designed to allow repeated extraction of the smallest remaining key (Skiena 1990, p. 38).

A subset S subset R^n is said to be pseudo-convex at a point x in S if the associated pseudo-tangent cone P_S(x) to S at x contains S-{x}, i.e., if S-{x} subset P_S(x). Any ...

The pseudo-tangent cone P_S(x) of a subset S subset R^n at a point x in S is the set P_S(x)=convK_S^_, where K_S is the contingent cone of S and where conv(A) is the smallest ...

A function f defined on a subset S subset R^n is said to be pseudoconcave if -f is pseudoconvex.

A pyritohedron is an irregular dodecahedron composed of identical irregular pentagons. The name "pyritohedron" derives from that fact that a common crystal form in pyrite has ...

int_(-infty)^infty(J_(mu+xi)(x))/(x^(mu+xi))(J_(nu-xi)(y))/(y^(nu-xi))e^(itxi)dxi =[(2cos(1/2t))/(x^2e^(-it/2)+y^2e^(it/2))]^((mu+nu)/2) ...

A Young tableau chosen at random from those having a given shape. A random tableau can be generated by RandomTableau[shape] in the Wolfram Language package Combinatorica` . ...

A type of error-correcting code that is related to Hadamard matrices.

In a complete metric space, a countable union of nowhere dense sets is said to be meager; the complement of such a set is a residual set.