Search Results for ""

A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...

A two-sided (doubly infinite) Z-Transform, Z^((2))[{a_n}_(n=-infty)^infty](z)=sum_(n=-infty)^infty(a_n)/(z^n) (Zwillinger 1996; Krantz 1999, p. 214). The bilateral transform ...

The third-order ordinary differential equation 2y^(''')+yy^('')=0. This equation arises in the theory of fluid boundary layers, and must be solved numerically (Rosenhead ...

If f has no spectrum in [-lambda,lambda], then ||f||_infty<=pi/(2lambda)||f^'||_infty (1) (Bohr 1935). A related inequality states that if A_k is the class of functions such ...

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 function defined by the contour integral J_(n,k)(z) =1/(2pii)int^((0+))t^(-n-1)(t+1/t)^kexp[1/2z(t-1/t)]dt, where int_((0+)) denotes the contour encircling the point z=0 ...

Various forms of opening and closing bracket-like delimiters are used for a number of distinct notational purposes in mathematics. The most common variants of bracket ...

Let X and Y be CW-complexes, and let f:X->Y be a continuous map. Then the cellular approximation theorem states that any such f is homotopic to a cellular map. In fact, if ...

A tree (also called a central tree) having a single node that is a graph center. The numbers of centered trees on n=1, 2, ... nodes are 1, 0, 1, 1, 2, 3, 7, 12, 27, 55, 127, ...

A number which can be computed to any number of digits desired by a Turing machine. Surprisingly, most irrationals are not computable numbers!