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 on the Tower of Hanoi graphs at stage with dimension equal to 3 and 4. The entropy per site is defined as , where is the number of vertices on . 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 is evaluated to more than a hundred digits correct. Using the results with less than or equal to 4, we predict the general form of the lower and upper bounds for with arbitrary .
Paper Prompts
Sign up for free to create and run prompts on this paper.