Search Results for ""
11 - 20 of 394 for Necessaryand Sufficient ConditionSearch Results
A function phi(t) satisfies the Hölder condition on two points t_1 and t_2 on an arc L when |phi(t_2)-phi(t_1)|<=A|t_2-t_1|^mu, with A and mu positive real constants. In some ...
For the Helmholtz differential equation to be separable in a coordinate system, the scale factors h_i in the Laplacian del ...
The ratio C of the largest to smallest singular value in the singular value decomposition of a matrix. The base-b logarithm of C is an estimate of how many base-b digits are ...
A set of vectors in Euclidean n-space is said to satisfy the Haar condition if every set of n vectors is linearly independent (Cheney 1999). Expressed otherwise, each ...
If {a_j} subset= D(0,1) (with possible repetitions) satisfies sum_(j=1)^infty(1-|a_j|)<=infty, where D(0,1) is the unit open disk, and no a_j=0, then there is a bounded ...
Given a set A, let N(A) be the set of neighbors of A. Then the bipartite graph G with bipartitions X and Y has a perfect matching iff |N(A)|>=|A| for all subsets A of X.
The Lyapunov condition, sometimes known as Lyapunov's central limit theorem, states that if the (2+epsilon)th moment (with epsilon>0) exists for a statistical distribution of ...
For a given positive integer n, does there exist a weighted tree with n graph vertices whose paths have weights 1, 2, ..., (n; 2), where (n; 2) is a binomial coefficient? ...
The descending chain condition, commonly abbreviated "D.C.C.," is the dual notion of the ascending chain condition. The descending chain condition for a partially ordered set ...
The ascending chain condition, commonly abbreviated "A.C.C.," for a partially ordered set X requires that all increasing sequences in X become eventually constant. A module M ...
...
View search results from all Wolfram sites (58560 matches)

