Champs lents-rapides complexes à une dimension lente
Coloring Algorithms for Dynamical Systems in the Complex Plane
Compacts connexes invariants par une application univalente
Let K be a compact connected subset of cc, not reduced to a point, and F a univalent map in a neighborhood of K such that F(K) = K. This work presents a study and a classification of the dynamics of F in a neighborhood of K. When ℂ K has one or two connected components, it is proved that there is a natural rotation number associated with the dynamics. If this rotation number is irrational, the situation is close to that of “degenerate Siegel disks” or “degenerate Herman rings” studied by R. Pérez-Marco...
Complex one-frequency cocycles
We show that on a dense open set of analytic one-frequency complex valued cocycles in arbitrary dimension Oseledets filtration is either dominated or trivial. The underlying mechanism is different from that of the Bochi-Viana Theorem for continuous cocycles, which links non-domination with discontinuity of the Lyapunov exponent. Indeed, in our setting the Lyapunov exponents are shown to depend continuously on the cocycle, even if the initial irrational frequency is allowed to vary. On the other...
Conjugations on rotation domains as limit functions of the geometric means of the iterates.
Continuous dynamical systems on Taut complex manifolds
Control a state-dependent dynamic graph to a pre-specified structure
Recent years have witnessed an increasing interest in coordinated control of distributed dynamic systems. In order to steer a distributed dynamic system to a desired state, it often becomes necessary to have a prior control over the graph which represents the coupling among interacting agents. In this paper, a simple but compelling model of distributed dynamical systems operating over a dynamic graph is considered. The structure of the graph is assumed to be relied on the underling system's states....