Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

The chain recurrent set for maps of compacta

100%
Yokoi K.
Annales Polonici Mathematici
|
2007
|
tom 92
|
nr 2
123-131
EN
For a self-map of a compactum we give a necessary and sufficient condition for the chain recurrent set to be precisely the set of periodic points.
2
Content available remote

Strong Transitivity and Graph Maps

100%
Yokoi K.
Bulletin of the Polish Academy of Sciences. Mathematics
|
2005
|
tom 53
|
nr 4
377-388
EN
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.
3
Content available remote

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

100%
Yokoi K.
Colloquium Mathematicum
|
2010
|
tom 119
|
nr 2
229-236
EN
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).
4
Content available remote

On strong chain recurrence for maps

100%
Yokoi K.
Annales Polonici Mathematici
|
2015
|
tom 114
|
nr 2
165-177
EN
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 chain recurrence set and the chain recurrence set. Several examples are given to illustrate the difference between the concepts of strong chain recurrence and chain recurrence.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.