Search Results for ""

The integral representation of ln[Gamma(z)] by lnGamma(z) = int_1^zpsi_0(z^')dz^' (1) = int_0^infty[(z-1)-(1-e^(-(z-1)t))/(1-e^(-t))](e^(-t))/tdt, (2) where lnGamma(z) is the ...

The Mangoldt function is the function defined by Lambda(n)={lnp if n=p^k for p a prime; 0 otherwise, (1) sometimes also called the lambda function. exp(Lambda(n)) has the ...

Mann's iteration is the dynamical system defined for a continuous function f:[0,1]->[0,1], x_n=1/nsum_(k=0)^(n-1)f(x_k) with x_0 in [0,1]. It can also be written ...

A random process whose future probabilities are determined by its most recent values. A stochastic process x(t) is called Markov if for every n and t_1<t_2...<t_n, we have ...

Matrix decomposition refers to the transformation of a given matrix (often assumed to be a square matrix) into a given canonical form.

A group in which the elements are square matrices, the group multiplication law is matrix multiplication, and the group inverse is simply the matrix inverse. Every matrix ...

A polynomial with matrix coefficients. An nth order matrix polynomial in a variable t is given by P(t)=A_0+A_1t+A_2t^2+...+A_nt^n, where A_k are p×p square matrices.

subjMathematics:Discrete Mathematics:Graph Theory:Cliques The maximal clique polynomial C_G(x) for the graph G may be defined as the polynomial ...

The maximum degree, sometimes simply called the maximum degree, of a graph G is the largest vertex degree of G, denoted Delta.

A derived polygon with side ratios chosen as r=1/2 so that inscribed polygons are constructed by connecting the midpoints of the base polygon. For a triangle P, the ...