Welcome to Journal of University of Chinese Academy of Sciences,Today is
优秀博士论文

Complexity of Dynamical System and Tuples

  • HUANG Wen ,
  • YE Xiang-Dong
Expand
  • Department of Mathematics, University of Science and Technology of China, Hefei 230026, China

Received date: 1900-01-01

  Revised date: 1900-01-01

  Online published: 2006-09-15

Abstract

In this paper, we summarize our recent work on some complexity problems in dynamical
systems related to chaos, entropy and recurrence properties under the ideas of localization (pairs or
tuples). We solve a long open problem by proving that Devaney chaos implies Li-Yorke one. We show
that there are ’many’ compacta admitting completely scrambled homeomorphisms, which include some
countable compacta, the cantor set and continua of arbitrary dimension. Using the local notions of
entropy: entropy tuples and sequence entropy pairs, we characterize the structures of a topological K-
system and a topological null system. Finally, we give a ner classi cation of recurrence properties in
terms of weak disjointness, complexity function of an open cover, and access time set.

Cite this article

HUANG Wen , YE Xiang-Dong . Complexity of Dynamical System and Tuples[J]. Journal of University of Chinese Academy of Sciences, 2006 , 23(5) : 701 -707 . DOI: 10.7523/j.issn.2095-6134.2006.5.022

Outlines

/