Hostname: page-component-74656f9884-54qdv Total loading time: 0 Render date: 2026-11-10T05:30:24.952Z Has data issue: false hasContentIssue false

The speed interval: a rotation algorithm for endomorphisms of the circle

Published online by Cambridge University Press:  19 September 2008

Jan Barkmeijer
Affiliation:
Mathematisch Instituut, Postbus 800, 9700 AV Groningen, The Netherlands
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let f be a continuous map of the circle into itself of degree one. We introduce the notion of rotation algorithms. One of these algorithms associates each z ∈ S1 with an interval, the so-called speed interval S(z, f), which is contained in the rotation interval ρ(f) of f. In contrast with the rotation set ρ(z, f), the interval S(z, f) sometimes allows us to ascertain that ρ(f) is non-degenerate, by using only finitely many elements of {fn (z) | n ≥ 0}. We further show that all choices for ρ(z, f) and S(z, f) occur, for certain z ∈ S1 provided that ρ(z, f) ⊂ S(z, f) ⊂ ρ(f).

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1988