Search Results for ""

sum_(k=0)^m(phi_k(x)phi_k(y))/(gamma_k)=(phi_(m+1)(x)phi_m(y)-phi_m(x)phi_(m+1)(y))/(a_mgamma_m(x-y),) (1) where phi_k(x) are orthogonal polynomials with weighting function ...

Let {p_n(x)} be orthogonal polynomials associated with the distribution dalpha(x) on the interval [a,b]. Also let rho=c(x-x_1)(x-x_2)...(x-x_l) (for c!=0) be a polynomial of ...

One of the quantities lambda_i appearing in the Gauss-Jacobi mechanical quadrature. They satisfy lambda_1+lambda_2+...+lambda_n = int_a^bdalpha(x) (1) = alpha(b)-alpha(a) (2) ...

The Christoffel symbols are tensor-like objects derived from a Riemannian metric g. They are used to study the geometry of the metric and appear, for example, in the geodesic ...

The first type of tensor-like object derived from a Riemannian metric g which is used to study the geometry of the metric. Christoffel symbols of the first kind are variously ...

Christoffel symbols of the second kind are the second type of tensor-like object derived from a Riemannian metric g which is used to study the geometry of the metric. ...

The chromatic invariant theta(G) of a connected graph G is the number of spanning trees of G that have internal activity 1 and external activity 0. For graphs other than the ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

The chromatic polynomial pi_G(z) of an undirected graph G, also denoted C(G;z) (Biggs 1973, p. 106) and P(G,x) (Godsil and Royle 2001, p. 358), is a polynomial which encodes ...

Two nonisomorphic graphs are said to be chromatically equivalent (also termed "chromically equivalent by Bari 1974) if they have identical chromatic polynomials. A graph that ...