Search Results for ""

The integral transform (Kf)(x)=Gamma(p)int_0^infty(x+t)^(-p)f(t)dt. Note the lower limit of 0, not -infty as implied in Samko et al. (1993, p. 23, eqn. 1.101).

The sum rule for differentiation states d/(dx)[f(x)+g(x)]=f^'(x)+g^'(x), (1) where d/dx denotes a derivative and f^'(x) and g^'(x) are the derivatives of f(x) and g(x), ...

The W-transform of a function f(x) is defined by the integral where Gamma[(beta_m)+s, 1-(alpha_n)-s; (alpha_p^(n+1))+s, 1-(beta_q^(m+1))-s] =Gamma[beta_1+s, ..., beta_m+s, ...

The integral transform defined by (Kphi)(x) =int_(-infty)^inftyG_(p+2,q)^(m,n+2)(t|1-nu+ix,1-nu-ix,(a_p); (b_p))phi(t)dt, where G_(c,d)^(a,b) is the Meijer G-function.

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

Let c_k be the number of edge covers of a graph G of size k. Then the edge cover polynomial E_G(x) is defined by E_G(x)=sum_(k=0)^mc_kx^k, (1) where m is the edge count of G ...

A class formed by sets in R^n which have essentially the same structure, regardless of size, shape and dimension. The "essential structure" is what a set keeps when it is ...

On a Riemannian manifold M, there is a canonical connection called the Levi-Civita connection (pronounced lē-vē shi-vit-e), sometimes also known as the Riemannian connection ...

The idea of a velocity vector comes from classical physics. By representing the position and motion of a single particle using vectors, the equations for motion are simpler ...

The rank polynomial R(x,y) of a general graph G is the function defined by R(x,y)=sum_(S subset= E(G))x^(r(S))y^(s(S)), (1) where the sum is taken over all subgraphs (i.e., ...