Search Results for ""

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...

The finite zeros of the derivative r^'(z) of a nonconstant rational function r(z) that are not multiple zeros of r(z) are the positions of equilibrium in the field of force ...

Every Boolean algebra is isomorphic to the Boolean algebra of sets. The theorem is equivalent to the maximal ideal theorem, which can be proved without using the axiom of ...

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_5=f(x_5). Then Boole's rule approximating the ...

The bootstrap method is a computer-based method for assigning measures of accuracy to sample estimates (Efron and Tibshirani 1994). This technique allows estimation of the ...

The great success mathematicians had studying hypergeometric functions _pF_q(a_1,...,a_p;b_1,...,b_q;z) for the convergent cases (p<=q+1) prompted attempts to provide ...

A Borel set is an element of a Borel sigma-algebra. Roughly speaking, Borel sets are the sets that can be constructed from open or closed sets by repeatedly taking countable ...

A Banach space X has the approximation property (AP) if, for every epsilon>0 and each compact subset K of X, there is a finite rank operator T in X such that for each x in K, ...

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 ...

A transformation which transforms from a two-dimensional continuous uniform distribution to a two-dimensional bivariate normal distribution (or complex normal distribution). ...