TOPICS
Search

Search Results for ""


31 - 40 of 63 for strange attractorSearch Results
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 Heegaard splitting of a connected orientable 3-manifold M is any way of expressing M as the union of two (3,1)-handlebodies along their boundaries. The boundary of such a ...
D_(KY)=j+(sigma_1+...+sigma_j)/(|sigma_(j+1)|), (1) where sigma_1<=sigma_n are Lyapunov characteristic exponents and j is the largest integer for which ...
For a two-dimensional map with sigma_2>sigma_1, d_(Lya)=1-(sigma_1)/(sigma_2), where sigma_n are the Lyapunov characteristic exponents.
The Rabinovich-Fabrikant equation is the set of coupled linear ordinary differential equations given by x^. = y(z-1+x^2)+gammax (1) y^. = x(3z+1-x^2)+gammay (2) z^. = ...
A curious approximation to the Feigenbaum constant delta is given by pi+tan^(-1)(e^pi)=4.669201932..., (1) where e^pi is Gelfond's constant, which is good to 6 digits to the ...
Due to nonlinearities in weather processes, a butterfly flapping its wings in Tahiti can, in theory, produce a tornado in Kansas. This strong dependence of outcomes on very ...
Define the correlation integral as C(epsilon)=lim_(N->infty)1/(N^2)sum_(i,j=1; i!=j)^inftyH(epsilon-|x_i-x_j|), (1) where H is the Heaviside step function. When the below ...
The sequence defined by G(0)=0 and G(n)=n-G(G(n-1)). (1) The first few terms for n=1, 2, ... are 1, 1, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, ... (OEIS A005206). This can be ...
The Fibonacci number F_(n+1) gives the number of ways for 2×1 dominoes to cover a 2×n checkerboard, as illustrated in the diagrams above (Dickau). The numbers of domino ...
1|2|3|4|5|6|7 Previous Next

...