"Dimer model"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
23번째 줄: 23번째 줄:
  
 
Dimer configuration can be considered as the covering of the graph by pairs of fermions connected by an edge
 
Dimer configuration can be considered as the covering of the graph by pairs of fermions connected by an edge
 
 
 
  
 
 
 
 
53번째 줄: 51번째 줄:
  
 
 
 
 
 +
 +
 
 +
 +
<h5> </h5>
 +
 +
# detk[m_, n_] :=<br>  N[Product[<br>    Product[2 Cos[(Pi*l)/(m + 1)] + 2 I*Cos[(Pi*k)/(n + 1)], {k, 1,<br>      n}], {l, 1, m}], 10]<br> detk[4, 4]
  
 
 
 
 
134번째 줄: 138번째 줄:
 
* <br>
 
* <br>
 
** Richard Kenyon, The Annals of Probability Vol. 28, No. 2 (Apr., 2000), pp. 759-795
 
** Richard Kenyon, The Annals of Probability Vol. 28, No. 2 (Apr., 2000), pp. 759-795
* The asymptotic determinant of the discrete Laplacian<br>
+
* [http://dx.doi.org/10.1007/BF02392811 The asymptotic determinant of the discrete Laplacian]<br>
** Richard Kenyon, Acta Mathematica Volume 185, Number 2, 239-286
+
** Richard Kenyon, Acta Mathematica Volume 185, Number 2, 239-286, 2000
 
* Kasteleyn, P. W. (1961), "The statistics of dimers on a lattice. I. The number of dimer arrangements on a quadratic lattice", Physica 27 (12): 1209–1225
 
* Kasteleyn, P. W. (1961), "The statistics of dimers on a lattice. I. The number of dimer arrangements on a quadratic lattice", Physica 27 (12): 1209–1225
 
* http://www.ams.org/mathscinet
 
* http://www.ams.org/mathscinet
143번째 줄: 147번째 줄:
 
* http://pythagoras0.springnote.com/
 
* http://pythagoras0.springnote.com/
 
* [http://math.berkeley.edu/%7Ereb/papers/index.html http://math.berkeley.edu/~reb/papers/index.html]
 
* [http://math.berkeley.edu/%7Ereb/papers/index.html http://math.berkeley.edu/~reb/papers/index.html]
* http://dx.doi.org/10.1214/aop/1019160260
+
* http://dx.doi.org/10.1007/BF02392811
  
 
 
 
 

2010년 10월 2일 (토) 14:54 판

introduction

 

 

basic notions
  • dimer configurations
  • set of dimer configurations
  • partition function
  • Kasteleyn matrix

 

 

physics motivation

Dimer configuration can be considered as the covering of the graph by pairs of fermions connected by an edge

 

 

Termperley equivalence

spanning trees on \gamma rooted at x

Dimers on D(\gamma)

 

 

Domino tiling and height function

bipartite graph

 

 

weight systems

define a weight function on the edges of the graph \gamma

 

 

 
  1. detk[m_, n_] :=
     N[Product[
       Product[2 Cos[(Pi*l)/(m + 1)] + 2 I*Cos[(Pi*k)/(n + 1)], {k, 1,
         n}], {l, 1, m}], 10]
    detk[4, 4]

 

 

memo

http://www.umich.edu/~mctp/SciPrgPgs/events/2006/2006glsc/talks/hanany.pdf

 

Dimers and Dominos

 

http://pictor.math.uqam.ca/~plouffe/OEIS/archive_in_pdf/domino.pdf

 

history

 

 

related items[[Schramm–Loewner evolution (SLE)|]]

 

 

encyclopedia

 

 

books

 

 

expositions

 

 

articles

 

 

question and answers(Math Overflow)

 

 

blogs

 

 

experts on the field

 

 

links