We show that the p-periodic logistic equation xn+1 = μn mod pxn(1 − xn) has cycles (periodic solutions) of minimal periods 1, p, 2p, 3p, .... Then we extend Singer’s theorem to periodic difference equations, and use it to show the p-periodic logistic equation has at most p stable cycles. Also, we present computational methods investigating the stable cycles in case p = 2 and 3.

this paper considers the problem of stable limit cycles generating in a class of uncertain nonlinear systems which leads to stable oscillations in the system’s output.this is a wanted behavior in many practical engineering problems. for this purpose, first the equation of the desirable limit cycle is achieved according to shape, amplitude and frequency of the required output oscillations. then,...

Introduction Conclusions References

We use the concepts of composite maps, basins of attraction, basin switching, and saddle fly-by’s to make the ecological hypothesis of the existence of multiple attractors more accessible to experimental scrutiny. Specifically, in a periodically forced insect population growth model we identify multiple attractors, namely, two locally stable 4-cycles. Using the model-predicted basins of attract...

We present a method for constructing dynamical systems with robust, stable limit cycles in arbitrary dimensions. Our approach is based on a correspondence between dynamics in a class of differential equations and directed graphs on the n-dimensional hypercube (n-cube). When the directed graph contains a certain type of cycle, called a cyclic attractor, then a stable limit cycle solution of the ...