首页 | 本学科首页   官方微博 | 高级检索  
     


Dimer Coverings on the Sierpinski Gasket
Authors:Shu-Chiuan Chang  Lung-Chi Chen
Affiliation:(1) Department of Physics, National Cheng Kung University, Tainan, 70101, Taiwan;(2) Physics Division, National Center for Theoretical Science, National Taiwan University, Taipei, 10617, Taiwan;(3) Department of Mathematics, Fu Jen Catholic University, Taipei, 24205, Taiwan
Abstract:We present the number of dimer coverings N d (n) on the Sierpinski gasket SG d (n) at stage n with dimension d equal to two, three, four or five. When the number of vertices, denoted as v(n), of the Sierpinski gasket is an even number, N d (n) is the number of close-packed dimers. When the number of vertices is an odd number, no close-packed configurations are possible and we allow one of the outmost vertices uncovered. The entropy of absorption of diatomic molecules per site, defined as $S_{mathit{SG}_{d}}=lim_{ntoinfty}ln N_{d}(n)/v(n)$ , is calculated to be ln (2)/3 exactly for SG 2. The numbers of dimers on the generalized Sierpinski gasket SG d,b (n) with d=2 and b=3,4,5 are also obtained exactly with entropies equal to ln (6)/7, ln (28)/12, ln (200)/18, respectively. The number of dimer coverings for SG 3 is given by an exact product expression, such that its entropy is given by an exact summation expression. The upper and lower bounds for the entropy are derived in terms of the results at a certain stage for SG d (n) with d=3,4,5. As the difference between these bounds converges quickly to zero as the calculated stage increases, the numerical value of $S_{mathit{SG}_{d}}$ with d=3,4,5 can be evaluated with more than a hundred significant figures accurate. This paper is written during the Lung-Chi Chen visit to PIMS, University of British Columbia. The author thanks the institute for the hospitality.
Keywords:Dimers  Sierpinski gasket  Entropy  Recursion relations  Exact solution
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号