Search Results for ""
4711 - 4720 of 13134 for Naive set theorySearch Results
Let A be a C^*-algebra, then a linear functional f on A is said to be positive if it is a positive map, that is f(a)>=0 for all a in A_+. Every positive linear functional is ...
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 ...
The algebra A is called a pre-C^*-algebra if it satisfies all conditions to be a C^*-algebra except that its norm need not be complete.
A number r is an nth root of unity if r^n=1 and a primitive nth root of unity if, in addition, n is the smallest integer of k=1, ..., n for which r^k=1.
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 ...
A recurrence relation between the function Q arising in quota systems, Q(n,r)=Q(n-1,r-1)+Q(n-1,r).
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 random composition of a number n in k parts is one of the (n+k-1; n) possible compositions of n, where (n; k) is a binomial coefficient. A random composition can be given ...
A random partition of a number n is one of the P(n) possible partitions of n, where P(n) is the partition function P. A random partition can be given by RandomPartition[n] in ...
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` . ...
...
View search results from all Wolfram sites (53007 matches)

