Dense periodicity on graphs (Q2478071)

From MaRDI portal
Revision as of 00:11, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Dense periodicity on graphs
scientific article

    Statements

    Dense periodicity on graphs (English)
    0 references
    0 references
    14 March 2008
    0 references
    The paper extends the theorem by \textit{M. Barge} and \textit{J. Martin} [Proc. Am. Math. Soc. 94, 731--735 (1985; Zbl 0567.54024)] for continuous maps of a compact interval to continuous maps of a compact, connected, one-dimensional polyhedron \(G\). An analogous extension from intervals to trees is due to \textit{R. P. Roe} [Topol. Proc. 19, 237--248 (1994; Zbl 0872.54028)]. The main result is that if \(f:G\rightarrow G\) is continuous and has its periodic points dense in \(G\), then there is a positive integer \(N\) and a finite, empty, or countable collection of subgraphs \(G_i \subset G\) with disjoint interiors, each mapped to itself under \(f^N\), the restriction of \(f^N\) to each \(G_i\) is topologically mixing, and \(f^N\) is the identity on the complement of the union of the \(G_i\)'s.
    0 references
    transitive
    0 references
    totally transitive
    0 references
    topologically mixing
    0 references
    graph
    0 references
    0 references

    Identifiers