Search Results for ""
5781 - 5790 of 13135 for Discrete SetSearch Results
G = int_0^infty(e^(-u))/(1+u)du (1) = -eEi(-1) (2) = 0.596347362... (3) (OEIS A073003), where Ei(x) is the exponential integral. Stieltjes showed it has the continued ...
Another name for the confluent hypergeometric function of the second kind, defined by where Gamma(x) is the gamma function and _1F_1(a;b;z) is the confluent hypergeometric ...
An algebraic ring which appears in treatments of duality in algebraic geometry. Let A be a local Artinian ring with m subset A its maximal ideal. Then A is a Gorenstein ring ...
A unit of angular measure in which the angle of an entire circle is 400 gradians. A right angle is therefore 100 gradians. A gradian is sometimes also called a gon or a grade.
The four-dimensional version of the gradient, encountered frequently in general relativity and special relativity, is del _mu=[1/cpartial/(partialt); partial/(partialx); ...
int_a^b(del f)·ds=f(b)-f(a), where del is the gradient, and the integral is a line integral. It is this relationship which makes the definition of a scalar potential function ...
The determinant G(f_1,f_2,...,f_n)=|intf_1^2dt intf_1f_2dt ... intf_1f_ndt; intf_2f_1dt intf_2^2dt ... intf_2f_ndt; | | ... |; intf_nf_1dt intf_nf_2dt ... intf_n^2dt|.
The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, ...
Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...
The rank of a graph G is defined as r(G)=n-c, where n is the number of vertices on G and c is the number of connected components (Biggs 1993, p. 25).
...
View search results from all Wolfram sites (47352 matches)

