Rotation sets for graph maps of degree 1 (Q933635)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Rotation sets for graph maps of degree 1
    scientific article

      Statements

      Rotation sets for graph maps of degree 1 (English)
      0 references
      0 references
      0 references
      24 July 2008
      0 references
      One of the basic problems in combinatorial and topological dynamics is the characterization of the sets of periods for self mappings of one-dimensional spaces. The problem has its roots and motivation in the famous Sharkovskii Theorem for continuous self mappings of the line. Since then a lot of efforts has been spent in finding characterizations of the set of periods for more general one dimensional spaces. In the paper, for a continuous map on a topological graph containing a loop \(S\) the degree of the map (with respect to the loop \(S\)) is defined and, for a map of degree 1, rotation numbers. The rotation set of these maps and periods of periodic points having a given rotation number are studied. It is shown that if the graph has a single loop \(S\) then the set of rotation numbers of points in \(S\) has certain properties similar to the rotation set of a circle map. In particular, it is a compact interval and for every rational \(\alpha\) in this interval there exists a periodic point with rotation number \(\alpha\). It is also shown that, for a special class of maps (called combed maps), the rotation set displays the same properties as the rotation set of a continuous degree one circle map. Some examples and counterexamples illustrating the obtained results are presented.
      0 references
      0 references
      rotation numbers
      0 references
      graph maps
      0 references
      sets of periods
      0 references
      one-dimensional dynamics
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references