Search Results for ""

If the random variates X_1, X_2, ... satisfy the Lindeberg condition, then for all a<b, lim_(n->infty)P(a<(S_n)/(s_n)<b)=Phi(b)-Phi(a), where Phi is the normal distribution ...

A linear extension of a partially ordered set P is a permutation of the elements p_1, p_2, ... of P such that p_i<p_j implies i<j. For example, the linear extensions of the ...

The symbol o(x), pronounced "little-O of x," is one of the Landau symbols and is used to symbolically express the asymptotic behavior of a given function. In particular, if n ...

When P and Q are integers such that D=P^2-4Q!=0, define the Lucas sequence {U_k} by U_k=(a^k-b^k)/(a-b) for k>=0, with a and b the two roots of x^2-Px+Q=0. Then define a ...

A triangle center alpha:beta:gamma is called a major triangle center if the triangle center function alpha=f(a,b,c,A,B,C) is a function of angle A alone, and therefore beta ...

The inconic having inconic parameters x:y:z=a/(b+c-a):b/(a+c-b):c/(a+b-c). Its center is the mittenpunkt M of the triangle and its Brianchon point is the Nagel point Na. The ...

The radius rho of the midsphere of a polyhedron, also called the interradius. Let P be a point on the original polyhedron and P^' the corresponding point P on the dual. Then ...

A map projection given by the following transformation, x = lambda-lambda_0 (1) y = 5/4ln[tan(1/4pi+2/5phi)] (2) = 5/4sinh^(-1)[tan(4/5phi)]. (3) Here, x and y are the plane ...

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...