Search Results for ""

The two-dimensional Hammersley point set of order m is defined by taking all numbers in the range from 0 to 2^m-1 and interpreting them as binary fractions. Calling these ...

The sum I over all internal (circular) nodes of the paths from the root of an extended binary tree to each node. For example, in the tree above, the internal path length is ...

The sequence of numbers which are sums of distinct powers of 4. The first few are 0, 1, 4, 5, 16, 17, 20, 21, 64, 65, 68, 69, 80, 81, 84, ... (OEIS A000695). These numbers ...

A set S and a binary operator * are said to exhibit closure if applying the binary operator to two elements S returns a value which is itself a member of S. The closure of a ...

A trivalent tree, also called a 3-valent tree or a 3-Cayley tree, is a tree for which each node has vertex degree <=3. The numbers of trivalent trees on n=1, 2, ... nodes are ...

A C^*-algebra is a Banach algebra with an antiautomorphic involution * which satisfies (x^*)^* = x (1) x^*y^* = (yx)^* (2) x^*+y^* = (x+y)^* (3) (cx)^* = c^_x^*, (4) where ...

A representation of a C^*-algebra A is a pair (H,phi) where H is a Hilbert space and phi:A->B(H) is a *-homomorphism. (H,phi) is said to be faithful if phi is injective. For ...

A mathematical structure A is said to be closed under an operation + if, whenever a and b are both elements of A, then so is a+b. A mathematical object taken together with ...

A formal description of the constraints on the possible configurations of an experiment which is subject to given conditions. A design is sometimes called an experimental ...

Discrepancy is a measure of the deviation of a point set from a uniform distribution. In general, the computation of the discrepancy of a point set is computationally ...