Georgia Institute of Technology College of Sciences

In dynamical systems, the long term behavior is organized by invariant manifolds that serve as landmarks that organize the traffic. There are two main theorems (established around 40-60 years ago) that tell you that these manifolds persist under small perturbations: KAM theorem and the theory of normally hyperbolic manifolds. In recent times there have been constructive proofs of these results which also lead to effective algorithms which allow to explore what happens in the border of the applicability of the theorems. We plan to review the basic concepts and present the experimental results.

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.

Rogue waves are unusually large waves that appear from nowhere at the ocean. In the last 10 years or so, they have been the subject of numerous studies that propose homoclinic orbits of the NLS equation, the so-called breathers, to model such extreme events. Clearly, the NLS equation is an asymptotic approximation of the Euler equations in the spectral narrowband limit and it does not capture strong nonlinear features of the full Euler model. Motivated by the preceding studies, I will present recent results on deep-water modulated wavetrains and breathers of the Hamiltonian Zakharov equation, higher-order asymptotic model of the Euler equations for water waves. They provide new insights into the occurrence and existence of rogue waves and their breaking. Web info: http://arxiv.org/abs/1309.0668

An open problem of interest in combinatorial number theory is that of providing a non-ergodic proof to the so called polynomial Szemeredi theorem. So far, the landmark result in this venue is that of Green who considered the emergence of 3-term arithmetic progressions whose gap is a sum of two squares (not both zero) in dense sets of integers. In view of this we consider the following problem. Given two dense subsets A and S of a finite abelian group G, what is the weakest "pseudorandomness assumption" once put on S implies that A contains a 3-term arithmetic progressions whose gap is in S? We answer this question for G=Z_n and G = F_p^n. To quantify pseudorandomness we use Gowers norms.