Search Results for ""

Given a marked point process Phi of the form Phi=(T,Y)=((T_n)_(n>=1),(Y_n)_(n>=1)), the space Y=(Y_n)_(n>=1) is said to be the mark space of Phi.

The Diophantine equation x^2+y^2+z^2=3xyz. The Markov numbers m are the union of the solutions (x,y,z) to this equation and are related to Lagrange numbers.

A type I move (conjugation) takes AB->BA for A, B in B_n where B_n is a braid group. A type II move (stabilization) takes A->Ab_n or A->Ab_n^(-1) for A in B_n, and b_n, Ab_n, ...

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

A sequence X_1, X_2, ... of random variates is called Markov (or Markoff) if, for any n, F(X_n|X_(n-1),X_(n-2),...,X_1)=F(X_n|X_(n-1)), i.e., if the conditional distribution ...

A spectrum containing the real numbers larger than Freiman's constant.

If x takes only nonnegative values, then P(x>=a)<=(<x>)/a. (1) To prove the theorem, write <x> = int_0^inftyxP(x)dx (2) = int_0^axP(x)dx+int_a^inftyxP(x)dx. (3) Since P(x) is ...

The statistical index P_(ME)=(sump_n(q_0+q_n))/(sum(v_0+v_n)), where p_n is the price per unit in period n, q_n is the quantity produced in period n, and v_n=p_nq_n is the ...

If a matrix group is reducible, then it is completely reducible, i.e., if the matrix group is equivalent to the matrix group in which every matrix has the reduced form ...

Every point which can be constructed with a straightedge and compass, and no other points, can be constructed using identical matchsticks (i.e., identical movable line ...