Search Results for ""

Let n objects be picked repeatedly with probability p_i that object i is picked on a given try, with sum_(i)p_i=1. Find the earliest time at which all n objects have been ...

Given n sets of variates denoted {X_1}, ..., {X_n} , the first-order covariance matrix is defined by V_(ij)=cov(x_i,x_j)=<(x_i-mu_i)(x_j-mu_j)>, where mu_i is the mean. ...

A functor F is called covariant if it preserves the directions of arrows, i.e., every arrow f:A-->B is mapped to an arrow F(f):F(A)-->F(B).

A covariant tensor of rank 1, more commonly called a one-form (or "bra").

The transitive reflexive reduction of a partial order. An element z of a partially ordered set (X,<=) covers another element x provided that there exists no third element y ...

The covercosine, also called the coversed cosine, is a little-used trigonometric function defined by covercos(z) = vercos(1/2pi-z) (1) = 1+sinz, (2) where vercosz is the ...

Suppose that X^~,X are arcwise-connected and locally arcwise-connected topological spaces. Then (X^~,p) is said to be a covering space of X if p:X^~->X is a surjective ...

The Cox configuration is a (2^(d-1))_d configuration whose Levi graph is the d-hypercube graph.

The Coxeter configuration is a 12_3 configuration whose Levi graph is the Nauru graph.

An n×n square matrix M with M_(ii) = 1 (1) M_(ij) = M_(ji)>1 (2) for all i,j=1, ..., n.