Skip navigation

DSpace JSPUI

DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets

Learn More
DSpace logo
English
中文
  • Browse
    • Communities
      & Collections
    • Publication Year
    • Author
    • Title
    • Subject
    • Advisor
  • Search TDR
  • Rights Q&A
    • My Page
    • Receive email
      updates
    • Edit Profile
  1. NTU Theses and Dissertations Repository
  2. 理學院
  3. 物理學系
Please use this identifier to cite or link to this item: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/54717
Title: 平面易辛模型的對偶性
Dualities for Planar Ising Networks
Authors: Chia-Kai Kuo
郭家愷
Advisor: 黃宇廷(Yu-Tin Huang)
Keyword: 正交格拉斯曼,易辛模型,相變換,
Positive Orthogonal Grassmannian,Ising model,Phase transition,
Publication Year : 2020
Degree: 碩士
Abstract: 格拉斯曼是一個發展完善的數學結構,他可以用於計算微擾規範場論的散射幅度。在最近,該工具也被發現可以運用在平面易辛模型。本文討論了正交格拉斯曼的細胞結構與平面易辛模型之間的等價關係。我們提出了一種以微觀結構發法,來建立兩者之間的對應關係。由兩者之間的等效性,使我們可以引入兩種新遞歸方法來計算易辛網絡的關聯函數。第一種基於對偶變換,此種變換生成易辛模網絡屬於格拉斯曼中同一的細胞。我們可以用這種變換來解碎形晶格,其中遞歸公式成為有效耦合常數的精確重整化群方程。對於第二個,我們使用黏合方法,其中每次迭代將原始晶格的大小加倍。這導致更有效計算關聯函數,其中複雜度相對於辛模晶格點的數量呈對數比例增長。

Grassmannian is a well-developed mathematical structure to compute the scattering amplitudes of perturbative gauge theories. Recently, a new connection of this tool to the planar Ising model has been revealed. This thesis discusses the equivalence between planar Ising networks and cells in the positive orthogonal Grassmannian. We propose a microscopic construction based on amalgamation, which establishes the correspondence for any planar Ising network. The equivalence allows us to introduce two recursive methods for computing correlators of Ising networks. The first is based on duality moves, which generate networks belonging to the same cell in the Grassmannian. This leads to fractal lattices, where the recursion formulas become the exact RG equations of the effective couplings. For the second, we use amalgamation, where each iteration doubles the size of the seed lattice. This leads to an efficient way of computing the correlator where the complexity scales logarithmically with respect to the number of spin sites.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/54717
DOI: 10.6342/NTU202002223
Fulltext Rights: 有償授權
Appears in Collections:物理學系

Files in This Item:
File SizeFormat 
U0001-0208202019514100.pdf
  Restricted Access
3.24 MBAdobe PDF
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved