Search Results for ""

The numbers lambda_(nun) in the Gaussian quadrature formula Q_n(f)=sum_(nu=1)^nlambda_(nun)f(x_(nun)).

The cotree T^* of a spanning tree T in a connected graph G is the spacing subgraph of G containing exactly those edges of G which are not in T (Harary 1994, p. 39).

A countable set is a set that is either finite or denumerable. However, some authors (e.g., Ciesielski 1997, p. 64) use the definition "equipollent to the finite ordinals," ...

Given n sets of variates denoted {X_1}, ..., {X_n} , the first-order covariance matrix is defined by V_(ij)=cov(x_i,x_j)=<(x_i-mu_i)(x_j-mu_j)>, where mu_i is the mean. ...

A covariant tensor of rank 1, more commonly called a one-form (or "bra").

The transitive reflexive reduction of a partial order. An element z of a partially ordered set (X,<=) covers another element x provided that there exists no third element y ...

The covercosine, also called the coversed cosine, is a little-used trigonometric function defined by covercos(z) = vercos(1/2pi-z) (1) = 1+sinz, (2) where vercosz is the ...

Suppose that X^~,X are arcwise-connected and locally arcwise-connected topological spaces. Then (X^~,p) is said to be a covering space of X if p:X^~->X is a surjective ...

The Cox configuration is a (2^(d-1))_d configuration whose Levi graph is the d-hypercube graph.

The Coxeter configuration is a 12_3 configuration whose Levi graph is the Nauru graph.