Search Results for ""

For a sequence {chi_i}, the Levine-O'Sullivan greedy algorithm is given by chi_1 = 1 (1) chi_i = max_(1<=j<=i-1)(j+1)(i-chi_j) (2) for i>1. The sequence generated by this ...

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

Random walk trajectories which are composed of self-similar jumps. They are described by the Lévy distribution.

The fractal curve illustrated above, with base curve and motif illustrated below.

The ordinary differential equation y^('')+(1-|y|)y^'+y=0.

A type of diagram invented by Lewis Carroll (the name is an abbreviation of "Lewis") that can be used to determine the number of minimal covers of n numbers with k members.

L=sigma/(sigma_B), where sigma is the variance in a set of s Lexis trials and sigma_B is the variance assuming Bernoulli trials. If L<1, the trials are said to be subnormal, ...

D^*Dpsi=del ^*del psi+1/4Rpsi, where D is the Dirac operator D:Gamma(S^+)->Gamma(S^-), del is the covariant derivative on spinors, and R is the scalar curvature.

Second and higher derivatives of the metric tensor g_(ab) need not be continuous across a surface of discontinuity, but g_(ab) and g_(ab,c) must be continuous across it.

D^*Dpsi=del ^*del psi+1/4Rpsi-1/2F_L^+(psi), where D is the Dirac operator D:Gamma(W^+)->Gamma(W^-), del is the covariant derivative on spinors, R is the scalar curvature, ...