Searcharxiv⌕ Search

arXiv · 2609.30665

On Standard perturbations of the Affine twist map

Abstract

For any $t\in\mathbb{R}$, consider the Affine twist map $\rm{Aff_t}:\mathbb{T}^2\to\mathbb{T}^2$ given by $$\rm{Aff_t}(x,y)=(x+y \text{ mod 1}, y+t \text{ mod 1}).$$ The map $\rm{Aff_t}$ clearly possesses an invariant foliation by horizontal curves. If $t$ is rational, each leaf is periodic, and if $t$ is irrational, the orbit of each leaf is dense in the torus. In both cases, the vertical rotation set of the proper lift of $\rm{Aff_t}$ to the vertical cylinder is reduced to $\{t\}.$ Now, for $k\in\mathbb{R},$ define $$f_{k,t}(x,y):=(x+y+k\sin (2πx)\text{ mod 1},y+k\sin (2πx)+t\text{ mod 1}).$$ We show that: 1) when $t=p/q$ for integers $p$ and $q>0$, KAM theory implies the existence of a constant $k_{p/q}>0$ such that for $|k|<k_{p/q}$, the vertical rotation set of an adequate lift of $f_{k,p/q}$ is just $\{p/q\}.$ 2) when $t$ is irrational, for any $k\neq 0$ the vertical rotation set of the adequate lift of $f_{k,t}$ is a non-degenerate interval which contains $t$ in its interior. In other words, it is not easy to build area-preserving twist maps whose vertical rotation sets are reduced to a single irrational number. From Theorem A of \cite{eujul}, such a map needs to have an invariant foliation by Lipschitz graphs over the horizontal coordinate. In particular, all its iterates must satisfy a twist condition. This is precisely what does not hold for $f_{k,t}$, for all non-zero values of $k$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Salvador Addas Zanata. 2026-09-25. On Standard perturbations of the Affine twist map. https://arxiv.org/abs/2609.30665

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Lyapunov stability of polynomial vector fields is undecidable

We show that there are integers $N$ and odd $D$ such that no algorithm can decide, from the rational coefficients of a homogeneous polynomial vector field $F$ in dimension $N$ of degree $D$, whether the origin is Lyapunov stable for $\dot Y=F(Y)$. This proves a conjecture of V. I. Arnold. We provide a Lean formalization of the proof. The smallest dimension $N$ for which we were able to prove undecidability is $N = 5$. An analogous undecidability result holds for global asymptotic stability and global exponential stability for non-homogenous vector fields. For dimension $N=2$ and homogenous vector fields, we establish decidability for all commonly used stability notions, building heavily on existing results.

math.DS↗

A topology for Engel expansions: evaluation and digit coding maps

We develop a topological framework for Engel expansions that treats both directions of the correspondence between points of $(0,1]$ and nondecreasing digit sequences. We endow the sequence space with the product topology to study the evaluation map, and we fix a nonterminating digit algorithm to study the digit coding map. We also record the correspondence between cylinder sets and fundamental intervals, and give an application to Baire category results for functions of the digits.

math.DS↗

Amenable graphs and the spectral radius of extensions of Markov maps

We discuss relations between the amenability of a graph and spectral properties of a random walk driven by a dynamical system. In order to include graphs which are not locally compact, we introduce the concept of amenability of weighted graphs, which generalises the usual notion as the new definition is shown to be equivalent to Folner's condition. As a first result, we obtain the following generalisation of Kesten's amenability criterion to graphs and non-independent increments: If the random walk is driven by a full-branched Gibbs-Markov map, the graph is amenable with respect to the weight induced by the random walk if and only if the spectral radius of the associated Markov operator is equal to one. By employing inducing schemes, one then obtains criteria for amenability through Markov maps with less regularity. We conclude the paper with the following applications to Schreier graphs. If the random walk is driven by a uniformly expanding map with non-Markovian increments or a Sinai billiard, then, under certain conditions, the Schreier graph is amenable if the probability of a return in time n does not decay exponentially in n. Furthermore, in the context of geometrically finite Kleinian groups, one obtains a version of Brooks's amenability criterion for not necessarily normal subgroups.

math.DS↗