Search Results for ""

A counterexample is a form of counter proof. Given a hypothesis stating that F(x) is true for all x in S, show that there exists a b in S such that F(b) is false, ...

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 ...

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).

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 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 ...