TOPICS
Search

Search Results for ""


7161 - 7170 of 13135 for Computational GeometrySearch Results
A method for computing an Egyptian fraction. This method always terminates (Beeckmans 1993).
A three-dimensional knot spun about a plane in four dimensions. Unlike suspended knots, spun knots are smoothly embedded at the poles.
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 square grid is a grid formed by tiling the plane regularly with squares.
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 fixed point for which the stability matrix has equal negative eigenvalues.
1 ... 714|715|716|717|718|719|720 ... 1314 Previous Next

...