Georgia Institute of Technology College of Sciences

We present a KAM-like theorem for the existence of quasi-periodic tori with a prescribed Diophantine rotation for a discrete family of dynamical system. The theorem is stated in an a posteriori format, so it can be used to validate numerical computations. The method of proof provides an efficient algorithm for computing quasi-periodic tori. We also present implementations of the algorithm, illustrating them throught several examples and observing different mechanisms of breakdown of qp invariant tori. This is a joint work with Alex Haro.

(Joint work with A. Avila and S. Jitomirskaya). An analytic, complex, one-frequency cocycle is given by a pair $(\alpha,A)$ where $A(x)$ is an analytic and 1-periodic function that maps from the torus $\mathbb(R) / \mathbb(Z)$ to the complex $d\times d$ matrices and $\alpha \in [0,1]$ is a frequency. The pair is interpreted as the map $(\alpha,A)\,:\, (x,v) \mapsto (x+\alpha), A(x) v$. Associated to the iterates of this map are (averaged) Lyapunov exponents $L_k(\alpha,A)$ and an Osceledets filtration. We prove joint-continuity in $(\alpha,A)$ of the Lyapunov exponents at irrational frequencies $\alpha$, give a criterion for domination and prove that for a dense open subset of cocycles, the Osceledets filtration comes from a dominated splitting which is an analogue to the Bochi-Viana Theorem.

Synchronization of coupled oscillators, such as grandfather clocks or metronomes, has been much studied using the approximation of strong damping in which case the dynamics of each reduces to a phase on a limit cycle. This gives rise to the famous Kuramoto model. In contrast, when the oscillators are Hamiltonian both the amplitude and phase of each oscillator are dynamically important. A model in which all-to-all coupling is assumed, called the Hamiltonian Mean Field (HMF) model, was introduced by Ruffo and his colleagues. As for the Kuramoto model, there is a coupling strength threshold above which an incoherent state loses stability and the oscillators synchronize. We study the case when the moments of inertia and coupling strengths of the oscillators are heterogeneous. We show that finite size fluctuations can greatly modify the synchronization threshold by inducing correlations between the momentum and parameters of the rotors. For unimodal parameter distributions, we find an analytical expression for the modified critical coupling strength in terms of statistical properties of the parameter distributions and confirm our results with numerical simulations. We find numerically that these effects disappear for strongly bimodal parameter distributions. *This work is in collaboration with Juan G. Restrepo.

There is known a lot of information about classical or standard shadowing. Itis also often called a pseudo-orbit tracing property (POTP). Let M be a closedRiemannian manifold. Diffeomorphism f : M → M is said to have POTPif for a given accuracy any pseudotrajectory with errors small enough can beapproximated (shadowed) by an exact trajectory. Therefore, if one wants to dosome numerical investiagion of the system one would definitely prefer it to haveshadowing property.However, now it is widely accepted that good (qualitatively strong) shad-owing is present only in hyperbolic situations. However it seems that manynonhyperbolic systems still could be well analysed numerically.As a step to resolve this contradiction I introduce some sort of weaker shad-owing. The idea is to restrict a set of pseudotrajectories to be shadowed. Onecan consider only pseudotrajectories that resemble sequences of points generatedby a computer with floating-point arithmetic.I will tell what happens in the (simplified) case of “linear” two-dimensionalsaddle connection. In this case even stochastic versions of classical shadowing(when one tries to ask only for most pseudotrajectories to be shadowed) do notwork. Nevertheless, for “floating-point” pseudotrajectories one can prove somepositive results.There is a dichotomy: either every pseudotrajectory stays close to the un-perturbed trajectory forever if one carefully chooses the dependence betweenthe size of errors and requested accuracy of shadowing, or there is always apseudotrajectory that can not be shadowed.