English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 94986/125531 (76%)
Visitors : 31109720      Online Users : 425
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 應用數學系 > 期刊論文 >  Item 140.119/130201
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/130201


    Title: Patterns generation and spatial entropy in two-dimensional lattice models
    Authors: 班榮超
    Ban, Jung-Chao
    Lin, Song-Sun
    Lin, Yin-Heng
    Contributors: 應數系
    Keywords: Lattice dynamical systems;Spatial entropy;Patterns generation;Connecting operator;Trace operator
    Date: 2007-09
    Issue Date: 2020-06-22 13:42:51 (UTC+8)
    Abstract: Patterns generation problems in two-dimensional lattice models are studied. Let S be the set of p symbols and ℤ2ℓ×2ℓ, ℓ ≥ 1, be a fixed finite square sublattice of ℤ2. Function U: ℤ 2ℓ×2ℓ → S is called local pattern. Given a basic set B of local patterns, a unique transition matrix A2 which is a q2 × q2 matrix, q = pℓ2, can be defined. The recursive formulae of higher transition matrix An on ℤ 2ℓ×nℓ have already been derived. Now Anm, m ≥ 1, contains all admissible patterns on ℤ(m+1)ℓ×nℓ which can be generated by B. In this paper, the connecting operator ℂ m, which comprises all admissible patterns on ℤ (m+1)ℓ×2ℓ, is care fully arranged. ℂm can be used to extend Anm to Anm+1 recursively for n ≥ 2. Furthermore, the lower bound of spatial entropy h(A2) can be derived through the diagonal part of ℂ m. This yields a powerful method for verifying the positivity of spatial entropy which is important in examining the complexity of the set of admissible global patterns. The trace operator Tm of ℂm can also be introduced. In the case of symmetric A2, T2m gives a good estimate of the upper bound on spatial entropy. Combining ℂm with Tm helps to understand the patterns generation problems more systematically
    Relation: Asian Journal of Mathematics, Vol.11, No.3, pp.497-534
    Data Type: article
    DOI 連結: http://dx.doi.org/ 10.4310/AJM.2007.v11.n3.a7
    DOI:  10.4310/AJM.2007.v11.n3.a7
    Appears in Collections:[應用數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    113.pdf407KbAdobe PDF15View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback