Characterization of periodic points of the negative slope algorithm
The notion of negative slope algorithm was introduced by \textit{S. Ferenczi}, \textit{C. Holton}, and \textit{L. Zamboni} [Ann. Inst. Fourier 51, 861--901 (2001; Zbl 1029.11036), J. Anal. Math. 89, 239--276 (2003; Zbl 1130.37324), J. Anal. Math. 93, 103--138 (2004; Zbl 1094.37005)] in their study of the three letter languages arising from three interval exchange transformations. They characterize eventually periodic points of the negative slope algorithm. In [Osaka J. Math. 44, 667--683 (2007; Zbl 1135.11040)], the first author and \textit{H. Nakada} introduced the natural extension of the negative slope algorithm. In this paper the authors give a necessary and sufficient condition for purely periodicity of the negative slope algorithm by using the natural extension of the negative slope algorithm.
- Some ergodic properties of the negative slope algorithm
- Some dynamic properties of the modified negative slope algorithm
- scientific article; zbMATH DE number 1008713
- The periods of periodic points for iterative mappings
- An algorithm for computing all the critical points of exponent periodic sequences
- Algorithms for determination of period-doubling bifurcation points in ordinary differential equations
- Computing periodic points on Veech surfaces
- On some results of periodic point
- Negative results in coconvex approximation of periodic functions
- Some ergodic properties of the negative slope algorithm
- Structure of three interval exchange transformations. I: An arithmetic study
- Structure of three-interval exchange transformations. II: A combinatorial description of the trajectories
- Structure of three-interval exchange transformations. III: Ergodic and spectral properties
This page was built for publication: Characterization of periodic points of the negative slope algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1001963)
