Search Results for ""

product_(i)dp_idq_i, where p_i and q_i are momenta and positions of particles.

A function f(x) satisfies the Lipschitz condition of order beta at x=0 if |f(h)-f(0)|<=B|h|^beta for all |h|<epsilon, where B and beta are independent of h, beta>0, and alpha ...

In abstract topology, a machine is method for producing infinite loop spaces and spectra. In automata theory, an abstract machine that is implemented in hardware is simply ...

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

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