Search Results for ""

Let Gamma(z) be the gamma function and n!! denote a double factorial, then [(Gamma(m+1/2))/(Gamma(m))]^2[1/m+(1/2)^21/(m+1)+((1·3)/(2·4))^21/(m+2)+...]_()_(n) ...

A function f(x) is said to have bounded variation if, over the closed interval x in [a,b], there exists an M such that |f(x_1)-f(a)|+|f(x_2)-f(x_1)|+... +|f(b)-f(x_(n-1))|<=M ...

Given a group G, the algebra CG is a vector space CG={suma_ig_i|a_i in C,g_i in G} of finite sums of elements of G, with multiplication defined by g·h=gh, the group ...

The product of a family {X_i}_(i in I) of objects of a category is an object P=product_(i in I)X_i, together with a family of morphisms {p_i:P->X_i}_(i in I) such that for ...

The categorical notion which is dual to product. The coproduct of a family {X_i}_(i in I) of objects of a category is an object C=coproduct_(i in I)X_i, together with a ...

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, ...

A bounded linear operator T in B(H) on a Hilbert space H is said to be cyclic if there exists some vector v in H for which the set of orbits ...

A variable that appears in a calculation only as a placeholder and which disappears completely in the final result. For example, in the integral int_0^xf(x^')dx^', x^' is a ...

A Dyck path is a staircase walk from (0,0) to (n,n) that lies strictly below (but may touch) the diagonal y=x. The number of Dyck paths of order n is given by the Catalan ...

A graph G with m edges is said to be elegant if the vertices of G can be labeled with distinct integers (0,1,2,...,m) in such a way that the set of values on the edges ...