Search Results for ""

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.

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

A requirement necessary for a given statement or theorem to hold. Also called a condition.

A function y=f(x) has critical points at all points x_0 where f^'(x_0)=0 or f(x) is not differentiable. A function z=f(x,y) has critical points where the gradient del f=0 or ...

The 6-polyiamond illustrated above.

Let f*g denote the cross-correlation of functions f(t) and g(t). Then f*g = int_(-infty)^inftyf^_(tau)g(t+tau)dtau (1) = ...

A root-finding algorithm used in LU decomposition. It solves the N^2 equations i<j l_(i1)u_(1j)+l_(i2)u_(2j)+...+l_(ii)u_(ij)=a_(ij)i=j ...