A Survey on the Relation Between Transitivity and Dense Periodicity for Graph Maps (Q4408575)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1941450
Language Label Description Also known as
default for all languages
No label defined
    English
    A Survey on the Relation Between Transitivity and Dense Periodicity for Graph Maps
    scientific article; zbMATH DE number 1941450

      Statements

      A Survey on the Relation Between Transitivity and Dense Periodicity for Graph Maps (English)
      0 references
      0 references
      0 references
      0 references
      30 November 2003
      0 references
      topological transitivity
      0 references
      graph maps
      0 references
      density of the set of periods
      0 references
      topological entropy
      0 references
      Let \(X\) be a topological space. A continuous map \(f \colon X \to X\) is called topologically transitive if for every nonempty open subsets \(U\), \(V \subset X\) there exists \(n \in \mathbb N\) such that \(f^n(U) \cap V \neq \emptyset\). If \(f^n\) is transitive for every \(n \in \mathbb N\), then \(f\) is called totally transitive. Here, \(f^n\) denotes the \(n\)-th iterate of \(f\). A (topological) graph is a connected compact metric space for which there exists a finite set \(V \subset G\) such that every connected component of \(G \setminus V\) is homeomorphic to an open interval of the real line. A graph map is a continuous map \(f \colon G \to G\). This article gives a survey of the relation between the transitivity, the density of periodic points and the topological entropy of graph maps.
      0 references
      0 references

      Identifiers