Search Results for ""
371 - 380 of 886 for application definition recordSearch Results
A differential k-form is a tensor of tensor rank k that is antisymmetric under exchange of any pair of indices. The number of algebraically independent components in n ...
The double factorial of a positive integer n is a generalization of the usual factorial n! defined by n!!={n·(n-2)...5·3·1 n>0 odd; n·(n-2)...6·4·2 n>0 even; 1 n=-1,0. (1) ...
Simply stated, floating-point algebra is algebra performed on floating-point representations by any number of automated devices. Traditionally, this definition is phrased so ...
The gnomon was an L-shaped movable sundial used for astronomical studies. It operated by resting on one leg so that the other pointed vertically upward. By measuring the ...
A connected graph G is said to be t-tough if, for every integer k>1, G cannot be split into k different connected components by the removal of fewer than tk vertices. The ...
An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...
Roughly speaking, a tangent vector is an infinitesimal displacement at a specific point on a manifold. The set of tangent vectors at a point P forms a vector space called the ...
The Meijer G-function is a very general function which reduces to simpler special functions in many common cases. The Meijer G-function is defined by (1) where Gamma(s) is ...
The set R union {infty}, obtained by adjoining one improper element to the set R of real numbers, is the set of projectively extended real numbers. Although notation is not ...
Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...
...
View search results from all Wolfram sites (23884 matches)

