Coherent lists and chaotic sets (Q652207): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.3934/dcds.2011.31.797 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3934/dcds.2011.31.797 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2319966467 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.3934/DCDS.2011.31.797 / rank
 
Normal rank

Latest revision as of 23:52, 9 December 2024

scientific article
Language Label Description Also known as
English
Coherent lists and chaotic sets
scientific article

    Statements

    Coherent lists and chaotic sets (English)
    0 references
    0 references
    13 December 2011
    0 references
    To construct chaotic sets is, in general, a difficult task in the study of discrete dynamical systems. The method which is usually employed is to present an inductive procedure, in which case it is almost impossible to follow the details of the proofs. The aim of the paper under review is to present some constructions of chaotic sets (Li-Yorke chaos, distributional chaos, mixing chaos,\dots) using a very elegant method stated by \textit{A. Iwanik} [in: The mathematical heritage of C.F. Gauss, Collect. Pap. Mem. C. F. Gauss, 372--378 (1991; Zbl 0780.58015)] (which adopts independence relations of Kuratowski and Mycielski) recently extended by Kato and Akin. Proofs of some known facts presented in an easier formulation are also stated.
    0 references
    distributional chaos
    0 references
    chaotic set
    0 references
    scrambled set
    0 references
    coherent list
    0 references
    residual relation
    0 references

    Identifiers