Search Results for ""

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

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

A random polygon containing the origin (Kovalenko 1999).

Let P=p:q:r and U=u:v:w be distinct trilinear points, neither lying on a sideline of DeltaABC. Then the crossdifference of P and U is the point X defined by trilinears ...

If P=p:q:r and U=u:v:w are distinct trilinear points, neither lying on a sideline of the reference triangle DeltaABC, then the crosssum of P and U is the point ...

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