Search Results for ""

A statistic defined to improve the Kolmogorov-Smirnov test in the tails.

F_k[P_N(k)](x)=F_k[exp(-N|k|^beta)](x), where F is the Fourier transform of the probability P_N(k) for N-step addition of random variables. Lévy showed that beta in (0,2) for ...

Sequences x_n^((1)), x_n^((2)), ..., x_n^((k)) are linearly dependent if constants c_1, c_2, ..., c_k (not all zero) exist such that sum_(i=1)^kc_ix_n^((i))=0 for n=0, 1, ....

A member of a collection of sets is said to be maximal if it cannot be expanded to another member by addition of any element. Maximal sets are important in graph theory since ...

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...

A module homomorphism is a map f:M->N between modules over a ring R which preserves both the addition and the multiplication by scalars. In symbols this means that ...

There are a number of attractive polyhedron compounds consisting of nine octahedra. The compound illustrated above can be constructed as the dual of cube 9-compound. The ...

Two functions f(x) and g(x) are orthogonal over the interval a<=x<=b with weighting function w(x) if <f(x)|g(x)>=int_a^bf(x)g(x)w(x)dx=0. (1) If, in addition, ...

A symbol employed in a formal propositional calculus.

Let V be a variety, and write G(V) for the set of divisors, G_l(V) for the set of divisors linearly equivalent to 0, and G_a(V) for the group of divisors algebraically equal ...