Coding Rules for Symmetric Periodic OrbitsAppearing through the Period-doubling Bifurcation

DOI

Bibliographic Information

Other Title
  • 周期倍分岐で生じた対称周期軌道の記号則

Abstract

Consider the two-dimensional area-preserving map which satisfies the condition that the Smale horseshoe exists at aac > 0. In the horseshoe, every periodic orbit is uniquely coded by two symbols 0 and 1. As a result, the symbol sequence s represented by 0 and 1 is determined. For the periodic orbit, the symbol sequence s is the repetition of a finite number of symbols named the code. Suppose that the mother periodic orbit M undergoes the period-doubling bifurcation. Then, the first generation of daughter periodic orbit D1 appears from M. The n (≥ 1)-th generation of daughter periodic orbit Dn is also defined. Let P0 be the code for M and Pn be the code for Dn (n ≥ 1). Our purpose is to derive the coding rule to determine Pn from the given P0. The coding rules for the restricted symmetric periodic orbits are derived.

Journal

Details 詳細情報について

  • CRID
    1390288015472321408
  • NII Article ID
    130008038000
  • DOI
    10.50916/rnaoj.21.0_1
  • ISSN
    24361402
    09156321
  • Text Lang
    ja
  • Data Source
    • JaLC
    • CiNii Articles
  • Abstract License Flag
    Allowed

Report a problem

Back to top