scholarly journals Locating Ruelle–Pollicott resonances*

Nonlinearity ◽  
2021 ◽  
Vol 35 (1) ◽  
pp. 513-566
Author(s):  
Oliver Butterley ◽  
Niloofar Kiamari ◽  
Carlangelo Liverani

Abstract We study the spectrum of transfer operators associated to various dynamical systems. Our aim is to obtain precise information on the discrete spectrum. To this end we propose a unitary approach. We consider various settings where new information can be obtained following different branches along the proposed path. These settings include affine expanding Markov maps, uniformly expanding Markov maps, non-uniformly expanding or simply monotone maps, hyperbolic diffeomorphisms. We believe this approach could be greatly generalised.

2007 ◽  
Vol DMTCS Proceedings vol. AH,... (Proceedings) ◽  
Author(s):  
Brigitte Vallée ◽  
Antonio Vera

International audience The Gaussian algorithm for lattice reduction in dimension 2 is precisely analysed under a class of realistic probabilistic models, which are of interest when applying the Gauss algorithm "inside'' the LLL algorithm. The proofs deal with the underlying dynamical systems and transfer operators. All the main parameters are studied: execution parameters which describe the behaviour of the algorithm itself as well as output parameters, which describe the geometry of reduced bases.


2008 ◽  
Vol 28 (2) ◽  
pp. 587-612 ◽  
Author(s):  
LUC REY-BELLET ◽  
LAI-SANG YOUNG

AbstractWe prove large deviation principles for ergodic averages of dynamical systems admitting Markov tower extensions with exponential return times. Our main technical result from which a number of limit theorems are derived is the analyticity of logarithmic moment generating functions. Among the classes of dynamical systems to which our results apply are piecewise hyperbolic diffeomorphisms, dispersing billiards including Lorentz gases, and strange attractors of rank one including Hénon-type attractors.


2015 ◽  
Vol 36 (6) ◽  
pp. 1757-1794 ◽  
Author(s):  
VALÉRIE BERTHÉ ◽  
JÉRÉMIE BOURDON ◽  
TIMO JOLIVET ◽  
ANNE SIEGEL

We define a generic algorithmic framework to prove a pure discrete spectrum for the substitutive symbolic dynamical systems associated with some infinite families of Pisot substitutions. We focus on the families obtained as finite products of the three-letter substitutions associated with the multidimensional continued fraction algorithms of Brun and Jacobi–Perron. Our tools consist in a reformulation of some combinatorial criteria (coincidence conditions), in terms of properties of discrete plane generation using multidimensional (dual) substitutions. We also deduce some topological and dynamical properties of the Rauzy fractals, of the underlying symbolic dynamical systems, as well as some number-theoretical properties of the associated Pisot numbers.


2019 ◽  
Vol 41 (2) ◽  
pp. 494-533 ◽  
Author(s):  
WEN HUANG ◽  
JIAN LI ◽  
JEAN-PAUL THOUVENOT ◽  
LEIYE XU ◽  
XIANGDONG YE

We study dynamical systems that have bounded complexity with respect to three kinds metrics: the Bowen metric $d_{n}$, the max-mean metric $\hat{d}_{n}$ and the mean metric $\bar{d}_{n}$, both in topological dynamics and ergodic theory. It is shown that a topological dynamical system $(X,T)$ has bounded complexity with respect to $d_{n}$ (respectively $\hat{d}_{n}$) if and only if it is equicontinuous (respectively equicontinuous in the mean). However, we construct minimal systems that have bounded complexity with respect to $\bar{d}_{n}$ but that are not equicontinuous in the mean. It turns out that an invariant measure $\unicode[STIX]{x1D707}$ on $(X,T)$ has bounded complexity with respect to $d_{n}$ if and only if $(X,T)$ is $\unicode[STIX]{x1D707}$-equicontinuous. Meanwhile, it is shown that $\unicode[STIX]{x1D707}$ has bounded complexity with respect to $\hat{d}_{n}$ if and only if $\unicode[STIX]{x1D707}$ has bounded complexity with respect to $\bar{d}_{n}$, if and only if $(X,T)$ is $\unicode[STIX]{x1D707}$-mean equicontinuous and if and only if it has discrete spectrum.


1992 ◽  
Vol 44 (1) ◽  
pp. 215-224 ◽  
Author(s):  
Qing Zhang

Entropy characterizations of different spectral and mixing properties of dynamical systems were dealt with by a number of authors (see [5], [6] and [8]).Given an infinite subset Γ = {tn}of N and a dynamical system (X, β,μ, T) one can define sequence entropy along for any finite Petition ξ, and hΓ(T) —supξ hΓ(T,ξ). In [6] Kushnirenko used sequence entropy to give a characterization of systems with discrete spectrum.


1996 ◽  
Vol 06 (01) ◽  
pp. 161-167
Author(s):  
M. KLEMM ◽  
P. E. BECKMANN

We will develop new methods to determine the topology of the basin boundary in a class of three-dimensional dynamical systems. One approach is to approximate the basin boundary by backward integration. Unfortunately, there are dynamical systems where it is hard to approximate the basin boundary by a numerical backward integration algorithm. We will introduce topological methods which will provide new information about the structure of the basin boundary. The topological invariants which we will use can be numerically computed.


Sign in / Sign up

Export Citation Format

Share Document