Papers
Topics
Authors
Recent
Search
2000 character limit reached

Dimer-monomer model on the generalized Tower of Hanoi graph

Published 19 Dec 2018 in math-ph and math.MP | (1812.08060v1)

Abstract: We study the number of dimer-monomers Md(n)M_d(n) on the Tower of Hanoi graphs THd(n)TH_d(n) at stage nn with dimension dd equal to 3 and 4. The entropy per site is defined as zTHd=limvlnMd(n)/vz_{TH_d}=\lim_{v \to \infty} \ln M_d(n)/v, where vv is the number of vertices on THd(n)TH_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 value of zTHdz_{TH_d} is evaluated to more than a hundred digits correct. Using the results with dd less than or equal to 4, we predict the general form of the lower and upper bounds for zTHdz_{TH_d} with arbitrary dd.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.