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 covariant tensor of rank 1, more commonly called a one-form (or "bra").

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.

Let sigma_1, ..., sigma_4 be four planes in general position through a point P and let P_(ij) be a point on the line sigma_i·sigma_j. Let sigma_(ijk) denote the plane ...

An entire Cremona transformation is a birational transformation of the plane. Cremona transformations are maps of the form x_(i+1) = f(x_i,y_i) (1) y_(i+1) = g(x_i,y_i), (2) ...

A standard form of the linear programming problem of maximizing a linear function over a convex polyhedron is to maximize c·x subject to mx<=b and x>=0, where m is a given ...