TOPICS
Search

Search Results for ""


9121 - 9130 of 13135 for Computational GeometrySearch Results
A type of number involving the roots of unity which was developed by Kummer while trying to solve Fermat's last theorem. Although factorization over the integers is unique ...
The idempotent numbers are given by B_(n,k)(1,2,3,...)=(n; k)k^(n-k), where B_(n,k) is a Bell polynomial and (n; k) is a binomial coefficient. A table of the first few is ...
An identity is a mathematical relationship equating one quantity to another (which may initially appear to be different).
The identity function id(x) is the function id(x)=x which assigns every real number x to the same real number x. It is identical to the identity map. The identity function is ...
The idiosyncratic polynomial is the bivariate graph polynomial defined as the characteristic polynomial in x of A+y(J-I-A), where A is the adjacency matrix, J is the unit ...
If and only if (i.e., necessary and sufficient). The terms "just if" or "exactly when" are sometimes used instead. A iff B is written symbolically as A<->B, A<=>B, A<->B, or ...
A matrix is ill-conditioned if the condition number is too large (and singular if it is infinite).
Radial line segments whose inward-pointing end produce the illusion of a circle or other figure. The apparent figure has the same color as the background, but appears ...
The imaginary part I[z] of a complex number z=x+iy is the real number multiplying i, so I[x+iy]=y. In terms of z itself, I[z]=(z-z^_)/(2i), where z^_ is the complex conjugate ...
For an n×n matrix, let S denote any permutation e_1, e_2, ..., e_n of the set of numbers 1, 2, ..., n, and let chi^((lambda))(S) be the character of the symmetric group ...
1 ... 910|911|912|913|914|915|916 ... 1314 Previous Next

...