TOPICS
Search

Search Results for ""


3951 - 3960 of 13135 for visualized mathematicsSearch Results
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 decomposition of a module into a direct sum of submodules. The index set for the collection of submodules is then called the grading set. Graded modules arise naturally in ...
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|.
Given a set V of m vectors (points in R^n), the Gram matrix G is the matrix of all possible inner products of V, i.e., g_(ij)=v_i^(T)v_j. where A^(T) denotes the transpose. ...
Let f_1(x), ..., f_n(x) be real integrable functions over the closed interval [a,b], then the determinant of their integrals satisfies
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 ...
1 ... 393|394|395|396|397|398|399 ... 1314 Previous Next

...