2015
DOI: 10.1080/10236198.2015.1066340
|View full text |Cite
|
Sign up to set email alerts
|

Generic chaos on graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…To prove that generic chaos together with these two conditions imply generic ε-chaos, we first study invariant subcontinua for a generically chaotic map on a dendrite satisfying the two conditions. Similarly as on the interval [55] and graphs [59], we are able to prove that the invariant non-degenerate subdendrites have large diameters; see Lemma 4.3. Of course, the topology of dendrites makes the proof much more complicated, among other reasons due to the phenomenon described on p. 2127.…”
Section: Introduction and Main Resultsmentioning
confidence: 63%
See 1 more Smart Citation
“…To prove that generic chaos together with these two conditions imply generic ε-chaos, we first study invariant subcontinua for a generically chaotic map on a dendrite satisfying the two conditions. Similarly as on the interval [55] and graphs [59], we are able to prove that the invariant non-degenerate subdendrites have large diameters; see Lemma 4.3. Of course, the topology of dendrites makes the proof much more complicated, among other reasons due to the phenomenon described on p. 2127.…”
Section: Introduction and Main Resultsmentioning
confidence: 63%
“…We know from [55] that the interval is such a space. By [59], even graphs are such spaces. However, in general, this is not true for dendrites; indeed, by [40], an ω-star admits a generically chaotic selfmap that is not generically ε-chaotic for any ε > 0 (an ω-star is a (topologically unique) dendrite having exactly one branch point, and this branch point is of infinite order).…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…To prove that generic chaos together with these two conditions imply generic ε-chaos, we first study invariant subcontinua for a generically chaotic map on a dendrite satisfying the two conditions. Similarly as on the interval [55] and graphs [59], we are able to prove that the invariant nondegenerate subdendrites have large diameters, see Lemma 4.3. Of course, the topology of dendrites makes the proof much more complicated, among other reasons due to the phenomenon described in Footnote 6.…”
Section: Proposition 11 ([40]mentioning
confidence: 62%
“…We now consider one-dimensional spaces. By [59], X contains all finite graphs and, by our Theorem A, it contains many, but not all, dendrites. We conjecture that Theorem A can be extended to local dendrites, i.e., we conjecture that a local dendrite is in X if and only if it is completely regular, with all points of finite order.…”
Section: Proposition 11 ([40]mentioning
confidence: 98%
See 1 more Smart Citation