Search Results for ""
61 - 70 of 633 for Logistic MapSearch Results

A map F from R^n to R^n is area-preserving if m(F^(-1)(A))=m(A) for every subregion A of R^n, where m(A) is the n-dimensional measure of A. A linear transformation is ...
f(x)=1/x-|_1/x_| for x in [0,1], where |_x_| is the floor function. The natural invariant of the map is rho(y)=1/((1+y)ln2).
Consider an n-dimensional deterministic dynamical system x^_^.=f^_(x) and let S be an n-1-dimensional surface of section that is traverse to the flow, i.e., all trajectories ...
Consider a one-dimensional Hamiltonian map of the form H(p,q)=1/2p^2+V(q), (1) which satisfies Hamilton's equations q^. = (partialH)/(partialp) (2) p^. = ...
A general formula giving the number of distinct ways of folding an m×n rectangular map is not known. A distinct folding is defined as a permutation of N=m×n numbered cells ...
A polynomial map phi_(f), with f=(f_1,...,f_n) in (K[X_1,...,X_n])^m in a field K is called invertible if there exist g_1,...,g_m in K[X_1,...,x_n] such that ...
The Fibonacci chain map is defined as x_(n+1) = -1/(x_n+epsilon+alphasgn[frac(n(phi-1))-(phi-1)]) (1) phi_(n+1) = frac(phi_n+phi-1), (2) where frac(x) is the fractional part, ...
A cubic map is three-colorable iff each interior region is bounded by an even number of regions. A non-cubic map bounded by an even number of regions is not necessarily ...
x_(n+1) = 2x_n (1) y_(n+1) = alphay_n+cos(4pix_n), (2) where x_n, y_n are computed mod 1 (Kaplan and Yorke 1979). The Kaplan-Yorke map with alpha=0.2 has correlation exponent ...
A point x^* which is mapped to itself under a map G, so that x^*=G(x^*). Such points are sometimes also called invariant points or fixed elements (Woods 1961). Stable fixed ...

...