Study of dimer–monomer on the generalized Hanoi graph

Wei Bang Li; Shu Chiuan Chang

doi:10.1007/s40314-020-1088-x

Study of dimer–monomer on the generalized Hanoi graph

Wei Bang Li, Shu Chiuan Chang

物理學系

研究成果: Article › 同行評審

摘要

We study the number of dimer–monomers M_d(n) on the Hanoi graphs H_d(n) at stage n with dimension d equal to 3 and 4. The entropy per site is defined as zHd=limv→∞lnMd(n)/v, where v is the number of vertices on H_d(n). We obtain the lower and upper bounds of the entropy per site, and the convergence of these bounds approaches to zero rapidly when the calculated stage increases. The numerical values of zHd for d= 3 , 4 are evaluated to more than a hundred digits correct. Using the results with d less than or equal to 4, we predict the general form of the lower and upper bounds for zHd with arbitrary d.

原文	English
文章編號	77
期刊	Computational and Applied Mathematics
卷	39
發行號	2
DOIs	https://doi.org/10.1007/s40314-020-1088-x
出版狀態	Published - 2020 五月 1

All Science Journal Classification (ASJC) codes

Computational Mathematics
Applied Mathematics

存取文件

10.1007/s40314-020-1088-x

其它文件與鏈接

指紋深入研究「Study of dimer–monomer on the generalized Hanoi graph」主題。共同形成了獨特的指紋。

引用此

@article{6aad67bf3dae49d6818fc83bb6f8816d,

title = "Study of dimer–monomer on the generalized Hanoi graph",

abstract = "We study the number of dimer–monomers Md(n) on the Hanoi graphs Hd(n) at stage n with dimension d equal to 3 and 4. The entropy per site is defined as zHd=limv→∞lnMd(n)/v, where v is the number of vertices on Hd(n). We obtain the lower and upper bounds of the entropy per site, and the convergence of these bounds approaches to zero rapidly when the calculated stage increases. The numerical values of zHd for d= 3 , 4 are evaluated to more than a hundred digits correct. Using the results with d less than or equal to 4, we predict the general form of the lower and upper bounds for zHd with arbitrary d.",

author = "Li, {Wei Bang} and Chang, {Shu Chiuan}",

note = "Funding Information: This research of S.-C.C. was supported in part by the MOST Grant 107-2515-S-006-002. Publisher Copyright: {\textcopyright} 2020, SBMAC - Sociedade Brasileira de Matem{\'a}tica Aplicada e Computacional.",

year = "2020",

month = may,

day = "1",

doi = "10.1007/s40314-020-1088-x",

language = "English",

volume = "39",

journal = "Computational and Applied Mathematics",

issn = "0101-8205",

publisher = "Birkhause Boston",

number = "2",

}

TY - JOUR

T1 - Study of dimer–monomer on the generalized Hanoi graph

AU - Li, Wei Bang

AU - Chang, Shu Chiuan

N1 - Funding Information: This research of S.-C.C. was supported in part by the MOST Grant 107-2515-S-006-002. Publisher Copyright: © 2020, SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional.

PY - 2020/5/1

Y1 - 2020/5/1

N2 - We study the number of dimer–monomers Md(n) on the Hanoi graphs Hd(n) at stage n with dimension d equal to 3 and 4. The entropy per site is defined as zHd=limv→∞lnMd(n)/v, where v is the number of vertices on Hd(n). We obtain the lower and upper bounds of the entropy per site, and the convergence of these bounds approaches to zero rapidly when the calculated stage increases. The numerical values of zHd for d= 3 , 4 are evaluated to more than a hundred digits correct. Using the results with d less than or equal to 4, we predict the general form of the lower and upper bounds for zHd with arbitrary d.

AB - We study the number of dimer–monomers Md(n) on the Hanoi graphs Hd(n) at stage n with dimension d equal to 3 and 4. The entropy per site is defined as zHd=limv→∞lnMd(n)/v, where v is the number of vertices on Hd(n). We obtain the lower and upper bounds of the entropy per site, and the convergence of these bounds approaches to zero rapidly when the calculated stage increases. The numerical values of zHd for d= 3 , 4 are evaluated to more than a hundred digits correct. Using the results with d less than or equal to 4, we predict the general form of the lower and upper bounds for zHd with arbitrary d.

UR - http://www.scopus.com/inward/record.url?scp=85079701421&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85079701421&partnerID=8YFLogxK

U2 - 10.1007/s40314-020-1088-x

DO - 10.1007/s40314-020-1088-x

M3 - Article

AN - SCOPUS:85079701421

VL - 39

JO - Computational and Applied Mathematics

JF - Computational and Applied Mathematics

SN - 0101-8205

IS - 2

M1 - 77

ER -