Currently displaying 1 – 4 of 4

Showing per page

Order by Relevance | Title | Year of publication

The size of the chain recurrent set for generic maps on an n-dimensional locally (n-1)-connected compact space

Katsuya Yokoi — 2010

Colloquium Mathematicae

For n ≥ 1, given an n-dimensional locally (n-1)-connected compact space X and a finite Borel measure μ without atoms at isolated points, we prove that for a generic (in the uniform metric) continuous map f:X → X, the set of points which are chain recurrent under f has μ-measure zero. The same is true for n = 0 (skipping the local connectedness assumption).

Strong Transitivity and Graph Maps

Katsuya Yokoi — 2005

Bulletin of the Polish Academy of Sciences. Mathematics

We study the relation between transitivity and strong transitivity, introduced by W. Parry, for graph self-maps. We establish that if a graph self-map f is transitive and the set of fixed points of f k is finite for each k ≥ 1, then f is strongly transitive. As a corollary, if a piecewise monotone graph self-map is transitive, then it is strongly transitive.

On strong chain recurrence for maps

Katsuya Yokoi — 2015

Annales Polonici Mathematici

This paper is concerned with strong chain recurrence introduced by Easton. We investigate the depth of the transfinite sequence of nested, closed invariant sets obtained by iterating the process of taking strong chain recurrent points, which is a related form of the central sequence due to Birkhoff. We also note the existence of a Lyapunov function which is decreasing off the strong chain recurrent set. As an application, we give a necessary and sufficient condition for the coincidence of the strong...

Page 1

Download Results (CSV)