Search Results for ""

The upper-trimmed subsequence of x={x_n} is the sequence lambda(x) obtained by dropping the first occurrence of n for each n. If x is a fractal sequence, then lambda(x)=x.

A function f is said to have a upper bound C if f(x)<=C for all x in its domain. The least upper bound is called the supremum. A set is said to be bounded from above if it ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

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

The upper half-plane is 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 (0,infty)}. Common notations ...

The limit of an upper sum, when it exists, as the mesh size approaches 0.

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

Let the greatest term H of a sequence be a term which is greater than all but a finite number of the terms which are equal to H. Then H is called the upper limit of the ...

For a given bounded function f(x) over a partition of a given interval, the upper sum is the sum of box areas M^*Deltax_k using the supremum M of the function f(x) in each ...

A triangular matrix U of the form U_(ij)={a_(ij) for i<=j; 0 for i>j. (1) Written explicitly, U=[a_(11) a_(12) ... a_(1n); 0 a_(22) ... a_(2n); | | ... |; 0 0 ... a_(nn)]. ...