Minimal subsystems of triangular maps of type 2∞; Conclusion of the Sharkovsky classification program

Tomasz Downarowicz

Chaos, Solitons & Fractals, 2013, vol. 49, issue C, 61-71

Abstract: The subject of this paper is to give the description, up to topological conjugacy, of possible minimal sets of triangular maps of the square of type 2∞. In [4], we give a general method allowing to embed any zero-dimensional almost 1–1 extension of the dyadic odometer (in particular any dyadic Toeplitz system) as a minimal set of a triangular map of this type. In this paper we present a method (a combination of that described in [4] with one introduced in [1]) of similarly embedding a special class of zero-dimensional almost 2–1 extensions of the odometer. We conjecture that these two embedding theorems exhaust all possibilities for nonperiodic minimal sets.

Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077913000337
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:49:y:2013:i:c:p:61-71

DOI: 10.1016/j.chaos.2013.02.005

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().