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

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.