Search Results for ""

The system of ordinary differential equations X^. = sigma(Y-X) (1) Y^. = rX-Y-XZ (2) Z^. = XY-bZ. (3)

The integral transform (Kf)(x)=int_0^infty((x-t)_+^(c-1))/(Gamma(c))_2F_1(a,b;c;1-t/x)f(t)dt, where Gamma(x) is the gamma function, _2F_1(a,b;c;z) is a hypergeometric ...

The lower-trimmed subsequence of x={x_n} is the sequence V(x) obtained by subtracting 1 from each x_n and then removing all 0s. If x is a fractal sequence, then V(x) is a ...

A function f is said to have a lower bound c if c<=f(x) for all x in its domain. The greatest lower bound is called the infimum.

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

The unit lower half-disk is the portion of the complex plane satisfying {|z|<=1,I[z]<0}.

The portion of the complex plane {x+iy:x,y in (-infty,infty)} satisfying y=I[z]<0, i.e., {x+iy:x in (-infty,infty),y in (-infty,0)}

The limit of a lower sum, when it exists, as the mesh size approaches 0.

Let the least term h of a sequence be a term which is smaller than all but a finite number of the terms which are equal to h. Then h is called the lower limit of the ...

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...