• DocumentCode
    2791483
  • Title

    Dynamical Complexity of Planar Piecewise Isometries

  • Author

    Chen, Zhan-He ; Fu, Xin-Chu ; Yu, Rong-Zhong

  • Author_Institution
    Dept. of Math., Shanghai Univ., Shanghai, China
  • fYear
    2009
  • fDate
    6-8 Nov. 2009
  • Firstpage
    11
  • Lastpage
    15
  • Abstract
    In this paper, we investigate dynamical complexity of general planar piecewise isometries. We reveal the relations between the complexity and the admissible finite words generated by a planar piecewise isometry, and present the necessary and sufficient conditions for the complexity to be zero. Furthermore, we give equivalent statements for the complexity to be not less than 1, and also discuss some essential properties about the complexity.
  • Keywords
    computational complexity; computational geometry; dynamical complexity; planar piecewise isometry; symbolic complexity; Chaos; Character generation; Educational institutions; Entropy; Image coding; Length measurement; Mathematics; Polynomials; Sufficient conditions; coding; complexity; isometry;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Chaos-Fractals Theories and Applications, 2009. IWCFTA '09. International Workshop on
  • Conference_Location
    Shenyang
  • Print_ISBN
    978-0-7695-3853-2
  • Type

    conf

  • DOI
    10.1109/IWCFTA.2009.10
  • Filename
    5361818
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2791483