TOPICS
Search

Search Results for ""


10351 - 10360 of 13135 for Computational GeometrySearch Results
The sequence produced by sorting the digits of a number and adding them to the previous number. The values starting with n=1, 2, ... are 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...
Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because ...
The maximal number of regions into which space can be divided by n planes is f(n)=1/6(n^3+5n+6) (Yaglom and Yaglom 1987, pp. 102-106). For n=1, 2, ..., these give the values ...
A sparse matrix is a matrix that allows special techniques to take advantage of the large number of "background" (commonly zero) elements. The number of zeros a matrix needs ...
A spatial-temporal point process is a point process which models data that is localized at a discrete set of locations in both space and time. In particular, a ...
A spatial point process is a point process which models data that is localized at a discrete set of locations in space or, more specifically, on a plane.
Given a ring R with identity, the special linear group SL_n(R) is the group of n×n matrices with elements in R and determinant 1. The special linear group SL_n(q), where q is ...
The special orthogonal group SO_n(q) is the subgroup of the elements of general orthogonal group GO_n(q) with determinant 1. SO_3 (often written SO(3)) is the rotation group ...
A square matrix A is a special orthogonal matrix if AA^(T)=I, (1) where I is the identity matrix, and the determinant satisfies detA=1. (2) The first condition means that A ...
The special unitary group SU_n(q) is the set of n×n unitary matrices with determinant +1 (having n^2-1 independent parameters). SU(2) is homeomorphic with the orthogonal ...

...