Search Results for ""

A lattice which is built up of layers of n-dimensional lattices in (n+1)-dimensional space. The vectors specifying how layers are stacked are called glue vectors. The order ...

The least common denominator of a collection of fractions (p_1)/(q_1),...,(p_n)/(q_n) is the least common multiple LCM(q_1,...,q_n) of their denominators.

Given a point P and a line AB, draw the perpendicular through P and call it PC. Let PD be any other line from P which meets CB in D. In a hyperbolic geometry, as D moves off ...

A local minimum, also called a relative minimum, is a minimum within some neighborhood that need not be (but may be) a global minimum.

The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...

Given order statistics Y_1=min_(j)X_j, Y_2, ..., Y_(N-1), Y_N=max_(j)X_j with sample size N, the midrange of the random sample is defined by MR=1/2(Y_1+Y_N) (Hogg and Craig ...

Let f be analytic on a domain U subset= C, and assume that f never vanishes. Then if there is a point z_0 in U such that |f(z_0)|<=|f(z)| for all z in U, then f is constant. ...

The minimum vertex degree, sometimes simply called the minimum degree, of a graph G is the smallest vertex degree of G, denoted delta.

An ordinary double point of a plane curve is point where a curve intersects itself such that two branches of the curve have distinct tangent lines. Ordinary double points of ...

2^(50)=1024^5 bytes. Although the term petabyte is sometimes used to refer to 1024^5 bytes, such usage is deprecated in favor of the standard SI naming convention of 1 ...