Search Results for ""

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

An equilateral parallelogram whose acute angles are 45 degrees. Sometimes, the restriction to 45 degrees is dropped, and it is required only that two opposite angles are ...

A method for constructing magic squares of odd order.

A two-dimensional map similar to the Hénon map but with the term -alphax_n^2 replaced by -alpha|x_n|. It is given by the equations x_(n+1) = 1-alpha|x_n|+y_n (1) y_(n+1) = ...