Search Results for ""

An equalizer of a pair of maps f,g:X->Y in a category is a map e:E->X such that 1. f degreese=g degreese, where degrees denotes composition. 2. For any other map e^':E^'->X ...

Define I_n=(-1)^nint_0^infty(lnz)^ne^(-z)dz, (1) then I_n=(-1)^nGamma^((n))(1), (2) where Gamma^((n))(z) is the nth derivative of the gamma function. Particular values ...

The general nonhomogeneous differential equation is given by x^2(d^2y)/(dx^2)+alphax(dy)/(dx)+betay=S(x), (1) and the homogeneous equation is x^2y^('')+alphaxy^'+betay=0 (2) ...

The four parameters e_0, e_1, e_2, and e_3 describing a finite rotation about an arbitrary axis. The Euler parameters are defined by e_0 = cos(phi/2) (1) e = [e_1; e_2; e_3] ...

The study of how the intrinsic structure of graphs ensures certain types of properties (e.g., clique-formation and graph colorings) under appropriate conditions.

A continuous statistical distribution which arises in the testing of whether two observed samples have the same variance. Let chi_m^2 and chi_n^2 be independent variates ...

A function f is Fréchet differentiable at a if lim_(x->a)(f(x)-f(a))/(x-a) exists. This is equivalent to the statement that phi has a removable discontinuity at a, where ...

The tabulation of raw data obtained by dividing it into classes of some size and computing the number of data elements (or their fraction out of the total) falling within ...

A golden rhombus is a rhombus whose diagonals are in the ratio p/q=phi, where phi is the golden ratio. The faces of the acute golden rhombohedron, Bilinski dodecahedron, ...

The assignment of labels or colors to the edges or vertices of a graph. The most common types of graph colorings are edge coloring and vertex coloring.