Search Results for ""

A method for computing an Egyptian fraction. This method always terminates (Beeckmans 1993).

An n×n array is called a square array. Considered as a matrix, a square array is called a square matrix.

A polynomial which is not necessarily an invariant of a link. It is related to the dichroic polynomial. It is defined by the skein relationship ...

A function f(x) is said to be square integrable if int_(-infty)^infty|f(x)|^2dx is finite.

A number taken to the power 2 is said to be squared, so x^2 is called "x squared." This terminology derives from the fact that the area of a square of edge length x is given ...

The squeeze theorem, also known as the squeezing theorem, pinching theorem, or sandwich theorem, may be stated as follows. Let there be two functions f_-(x) and f_+(x) such ...

Two vector bundles are stably equivalent iff isomorphic vector bundles are obtained upon Whitney summing each vector bundle with a trivial vector bundle.

A polynomial equation whose roots all have negative real parts. For a real quadratic equation z^2+Bz+C=0, the stability conditions are B,C>0. For a real cubic equation ...

A function composed of a set of equally spaced jumps of equal length, such as the ceiling function f(x)=[x], floor function f(x)=|_x_|, or nearest integer function f(x)=[x].

A space which is isomorphic to a Borel subset B of a Polish space equipped with its sigma-algebra of Borel sets.