Search Results for ""

An n-cycle is a finite sequence of points Y_0, ..., Y_(n-1) such that, under a map G, Y_1 = G(Y_0) (1) Y_2 = G(Y_1) (2) Y_(n-1) = G(Y_(n-2)) (3) Y_0 = G(Y_(n-1)). (4) In ...

A stable fixed point of a map which, in a dissipative dynamical system, is an attractor.

Let a patch be given by the map x:U->R^n, where U is an open subset of R^2, or more generally by x:A->R^n, where A is any subset of R^2. Then x(U) (or more generally, x(A)) ...

The winding number W(theta) of a map f(theta) with initial value theta is defined by W(theta)=lim_(n->infty)(f^n(theta)-theta)/n, which represents the average increase in the ...

Let R(x) be the revenue for a production x, C(x) the cost, and P(x) the profit. Then P(x)=R(x)-C(x), and the marginal profit for the x_0th unit is defined by ...

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