Search Results for ""

Let f be differentiable on the open interval (a,b) and continuous on the closed interval [a,b]. Then if f(a)=f(b), then there is at least one point c in (a,b) where f^'(c)=0. ...

A smooth manifold M=(M,g) is said to be semi-Riemannian if the indexMetric Tensor Index of g is nonzero. Alternatively, a smooth manifold is semi-Riemannian provided that it ...

The metric tensor g on a smooth manifold M=(M,g) is said to be semi-Riemannian if the index of g is nonzero. In nearly all literature, the term semi-Riemannian is used ...

In floating-point arithmetic, the significand is a component of a finite floating-point number containing its significant digits. Generally speaking, the significand can be ...

For a particular format in the IEEE 754-2008 framework, a subnormal number is a nonzero floating-point number with magnitude less than the magnitude of that formatÕs smallest ...

A symmetric function on n variables x_1, ..., x_n is a function that is unchanged by any permutation of its variables. In most contexts, the term "symmetric function" refers ...

A Tauberian theorem is a theorem that deduces the convergence of an series on the basis of the properties of the function it defines and any kind of auxiliary hypothesis ...

Let x and y be vectors. Then the triangle inequality is given by |x|-|y|<=|x+y|<=|x|+|y|. (1) Equivalently, for complex numbers z_1 and z_2, ...

A walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i (West 2000, p. 20). ...

A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...