Search Results for ""

A bounded left approximate identity for a normed algebra A is a bounded net {e_alpha}_(alpha in I) with the property lim_(alpha)e_alphaa=a for a in A. Bounded right and ...

The number of "prime" boxes is always finite, where a set of boxes is prime if it cannot be built up from one or more given configurations of boxes.

Let where (alpha)_j is a Pochhammer symbol, and let alpha be a negative integer. Then S(alpha,beta,m;z)=(Gamma(beta+1-m))/(Gamma(alpha+beta+1-m)), where Gamma(z) is the gamma ...

In a cyclic quadrilateral ABCD having perpendicular diagonals AC_|_BD, the perpendiculars to the sides through point T of intersection of the diagonals (the anticenter) ...

Let A_1, B_2, C_1, A_2, and B_1 be five points determining a conic. Then the conic is the locus of the point C_2=A_1(L·C_1A_2)·B_1(L·C_1B_2), where L is a line through the ...

An algebraic variety over a field K that becomes isomorphic to a projective space.

A number n for which a shortest chain exists which is a Brauer chain is called a Brauer number. There are infinitely many non-Brauer numbers.

If, in the Gershgorin circle theorem for a given m, |a_(jj)-a_(mm)|>Lambda_j+Lambda_m for all j!=m, then exactly one eigenvalue of A lies in the disk Gamma_m.

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

On a computer screen, the pixels indicating a slanted line are selected with Bresenham's algorithm, developed in 1962 while at IBM.