Search Results for ""

(theta_3(z,t)theta_4(z,t))/(theta_4(2z,2t))=(theta_3(0,t)theta_4(0,t))/(theta_4(0,2t))=(theta_2(z,t)theta_1(z,t))/(theta_1(2z,2t)), where theta_i are Jacobi theta functions. ...

F_k[P_N(k)](x)=F_k[exp(-N|k|^beta)](x), where F is the Fourier transform of the probability P_N(k) for N-step addition of random variables. Lévy showed that beta in (0,2) for ...

One million (10^6) bytes. Unfortunately, the term is sometimes also used to mean 2^(20)=1024^2=1048576 bytes. Furthermore, a third meaning of the term refers to 1024000 bytes ...

A generalization of Student's t-distribution known as the noncentral Student's t-distribution is given by (1) where Gamma(z) is the gamma function and _1F_1(a;b;z) is a ...

The ratio X_1/X_2 of uniform variates X_1 and X_2 on the interval [0,1] can be found directly as P_(X_1/X_2)(u) = int_0^1int_0^1delta((x_1)/(x_2)-u)dx_1dx_2 (1) = ...

Given two intersecting lines, the two nonadjacent angles with the same vertex are said to be vertical angles. One can easily prove that vertical angles are congruent. Some ...

If F(x) is a probability distribution with zero mean and rho=int_(-infty)^infty|x|^3dF(x)<infty, (1) where the above integral is a stieltjes integral, then for all x and n, ...

The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...

A chamfered icosahedron, also called a tritruncated rhombic triacontahedron, is a polyhedron obtained by chamfering a regular icosahedron. The illustration above shows ...

A labeled binary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2 and 3, branches from these leading to 4, 5 and 6, 7, respectively, and so ...