Search Results for ""

The Bowley skewness, also known as quartile skewness coefficient, is defied by ((Q_3-Q_2)-(Q_2-Q_1))/(Q_3-Q_1)=(Q_1-2Q_2+Q_3)/(Q_3-Q_1), where the Qs denote the interquartile ...

The function Pi_(a,b)(x)=H(x-a)-H(x-b) which is equal to 1 for a<=x<=b and 0 otherwise. Here H(x) is the Heaviside step function. The special case Pi_(-1/2,1/2)(x) gives the ...

Let where (alpha)_j is a Pochhammer symbol, and let alpha be a negative integer. Then S(alpha,beta,m;z)=(Gamma(beta+1-m))/(Gamma(alpha+beta+1-m)), where Gamma(z) is the gamma ...

Let beta=detB=x^2-ty^2, (1) where B is the Brahmagupta matrix, then det[B(x_1,y_1) B(x_2,y_2)] = det[B(x_1,y_1)]det[B(x_2,y_2)] (2) = beta_1beta_2]. (3)

B(x,y)=[x y; +/-ty +/-x]. (1) It satisfies B(x_1,y_1)B(x_2,y_2)=B(x_1x_2+/-ty_1y_2,x_1y_2+/-y_1x_2). (2) Powers of the matrix are defined by B^n = [x y; ty x]^n (3) = [x_n ...

An algebraic variety over a field K that becomes isomorphic to a projective space.

If, in the Gershgorin circle theorem for a given m, |a_(jj)-a_(mm)|>Lambda_j+Lambda_m for all j!=m, then exactly one eigenvalue of A lies in the disk Gamma_m.

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

On a computer screen, the pixels indicating a slanted line are selected with Bresenham's algorithm, developed in 1962 while at IBM.

One name for the figure used by Euclid to prove the Pythagorean theorem. It is sometimes also known as the "windmill."