Search Results for ""
821 - 830 of 996 for Fast Fourier TransformSearch Results
A projective space is a space that is invariant under the group G of all general linear homogeneous transformation in the space concerned, but not under all the ...
A pseudoforest is an undirected graph in which every connected component contains at most one graph cycle. A pseudotree is therefore a connected pseudoforest and a forest ...
A square n×n matrix A=a_(ij) is called reducible if the indices 1, 2, ..., n can be divided into two disjoint nonempty sets i_1, i_2, ..., i_mu and j_1, j_2, ..., j_nu (with ...
A regular pyramid is a right pyramid whose base is a regular polygon. For a right pyramid of height h with a regular n-gonal base of side length a and circumradius R, the ...
Sprague (1963) considered the problem of "rolling" five cubes, each which an upright letter "A" on its top, on a chessboard. Here "rolling" means the cubes are moved from ...
The root separation (or zero separation) of a polynomial P(x) with roots r_1, r_2, ... is defined by Delta(P)=min_(i!=j)|r_i-r_j|. There are lower bounds on how close two ...
If n>19, there exists a Poulet number between n and n^2. The theorem was proved in 1965.
The 20 Cayley lines generated by a hexagon inscribed in a conic section pass four at a time though 15 points known as Salmon points (Wells 1991). There is a dual relationship ...
Let M be a regular surface with v_(p),w_(p) points in the tangent space M_(p) of M. For M in R^3, the second fundamental form is the symmetric bilinear form on the tangent ...
A point process N is called self-correcting if cov(N(s,t),N(t,u))<0 for s<t<u where here, cov denotes the covariance of the two quantities. Intuitively, a process is ...
...