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

For a given function f(x) over a partition of a given interval, the lower sum is the sum of box areas m^*Deltax_k using the infimum m of the function f(x) in each subinterval ...

A triangular matrix L of the form L_(ij)={a_(ij) for i>=j; 0 for i<j. (1) Written explicitly, L=[a_(11) 0 ... 0; a_(21) a_(22) ... 0; | | ... 0; a_(n1) a_(n2) ... a_(nn)]. ...

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

If every component L of X/O_(p^')(X) satisfies the "Schreler property," then L_(p^')(Y)<=L_(p^')(X) for every p-local subgroup Y of X, where L_(p^') is the p-layer.