Search Results for ""

The equation f(x_n|x_s)=int_(-infty)^inftyf(x_n|x_r)f(x_r|x_s)dx_r which gives the transitional densities of a Markov sequence. Here, n>r>s are any integers (Papoulis 1984, ...

Characteristic classes are cohomology classes in the base space of a vector bundle, defined through obstruction theory, which are (perhaps partial) obstructions to the ...

The number of coincidences of a (nu,nu^') correspondence of value gamma on a curve of curve genus p is given by nu+nu^'+2pgamma.

If a one-parameter family of curves has index N and class M, the number tangent to a curve of order n_1 and class m_1 in general position is m_1N+n_1M.

In 1891, Chebyshev and Sylvester showed that for sufficiently large x, there exists at least one prime number p satisfying x<p<(1+alpha)x, where alpha=0.092.... Since the ...

The Chebyshev integral is given by intx^p(1-x)^qdx=B(x;1+p,1+q), where B(x;a,b) is an incomplete beta function.

int_a^bf_1(x)dxint_a^bf_2(x)dx...int_a^bf_n(x)dx <=(b-a)^(n-1)int_a^bf_1(x)f_2(x)...f_n(x)dx, where f_1, f_2, ..., f_n are nonnegative integrable functions on [a,b] which are ...

If a_1>=a_2>=...>=a_n (1) b_1>=b_2>=...>=b_n, (2) then nsum_(k=1)^na_kb_k>=(sum_(k=1)^na_k)(sum_(k=1)^nb_k). (3) This is true for any distribution.

A sum of the digits in a given transmission modulo some number. The simplest form of checksum is a parity bit appended on to 7-bit numbers (e.g., ASCII characters) such that ...

Consider the set of compact n-Riemannian manifolds M with diameter(M)<=d, Volume(M)>=V, and |K|<=kappa where kappa is the sectional curvature. Then there is a bound on the ...