Search Results for ""

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

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

A surface constructed by placing a family of figure-eight curves into R^3 such that the first and last curves reduce to points. The surface has parametric equations x(u,v) = ...

A Reinhardt domain with center c is a domain D in C^n such that whenever D contains z_0, the domain D also contains the closed polydisk.

Rényi entropy is defined as: H_alpha(p_1,p_2,...,p_n)=1/(1-alpha)ln(sum_(i=1)^np_i^alpha), where alpha>0, alpha!=1. As alpha->1, H_alpha(p_1,p_2,...,p_n) converges to ...