Search Results for ""
4191 - 4200 of 13134 for Descriptive set theorySearch Results
Any discrete finite wavelet transform can be represented as a matrix, and such a wavelet matrix can be computed in O(n) steps, compared to O(nlgn) for the Fourier matrix, ...
A sequence of numbers V={nu_n} is said to be weakly complete if every positive integer n beyond a certain point N is the sum of some subsequence of V (Honsberger 1985). ...
A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...
An optimal filter used for the removal of noise from a signal which is corrupted by the measuring process itself.
A knot which is not a tame knot.
Constants gamma such that [int_Omega|f|^qdx]^(1/q)<=gamma[int_Omegasum_(i=1)^N|(partialf)/(partialx_i)|^pdx]^(1/p), where f is a real-valued smooth function on a region Omega ...
A witness is a number which, as a result of its number theoretic properties, guarantees either the compositeness or primality of a number n. Witnesses are most commonly used ...
The sequence {F_n-1} is complete even if restricted to subsequences which contain no two consecutive terms, where F_n is a Fibonacci number.
A number N=p_1p_2...p_n where the p_is are distinct primes and n>=3 such that p_i=Ap_(i-1)+B (1) for i=1, 2, ..., n, p_0 taken as 1, and with A and B some fixed integers. For ...
The subset {0} of a ring. It trivially fulfils the definition of ideal since it is a group (specifically, the zero group), and it is closed under multiplication by any ...
...
View search results from all Wolfram sites (53251 matches)

