Abstract
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 \(z_{H_d}=\lim _{v \rightarrow \infty } \ln M_d(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 \(z_{H_d}\) 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 \(z_{H_d}\) with arbitrary d.
Similar content being viewed by others
References
Biggs NL (1993) Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge
Chang S-C, Chen L-C (2008) Dimer-monomer model on the Sierpinski gasket. Phys A 387:1551–1566
Chen H, Wu R, Huang G, Deng H (2015) Dimer monomer model on the Towers of Hanoi graphs. Int J Mod Phys B 29:1550173 (13 pages)
Chen H, Wu R, Huang G, Deng H (2017) Independent sets on the Towers of Hanoi graphs. ARS Math Contemp 12:247–260
D’Angeli D, Donno A, Nagnibeda T (2012) Counting dimer coverings on self-similar Schreier graphs. Eur J Combin 33:1484–1513
Falconer KJ (2003) Fractal Geometry: Mathematical Foundations and Applications, 2nd edn. Wiley, Chichester
Fisher ME (1961) Statistical mechanics of dimers on a plane lattice. Phys Rev 124:1664–1672
Fisher ME, Stephenson J (1963) Statistical mechanics of dimers on a plane lattice. II. Dimer correlations and monomers. Phys Rev 132:1411–1431
Gaunt DS (1969) Exact series-expansion study of the monomer-dimer problem. Phys Rev 179:174–186
Harary F (1969) Graph Theory. Addison-Wesley, New York
Heilmann OJ, Lieb EH (1970) Monomers and dimers. Phys Rev Lett 24:1412–1414
Heilmann OJ, Lieb EH (1972) Theory of monomer-dimer systems. Commun Math Phys 25:190–232
Izmailian NS, Oganesyan KB, Hu CK (2003) Exact finite-size corrections of the free energy for the square lattice dimer model under different boundary conditions. Phys Rev E 67:066114 (14 pages)
Izmailian NS, Priezzhev VB, Ruelle P, Hu CK (2005) Logarithmic conformal field theory and boundary effects in the dimer model. Phys Rev Lett 95:260602 (4 pages)
Izmailian NS, Oganesyan KB, Wu M-C, Hu CK (2006) Finite-size corrections and scaling for the triangular lattice dimer model with periodic boundary conditions. Phys Rev E 73:016128 (9 pages)
Jerrum M (1987) Two-dimensional monomer-dimer systems are computationally intractable. J Stat Phys 48:121–134; Jerrum M (1990) Erratum: Two-dimensional monomer-dimer systems are computationally intractable. J Stat Phys 59:1087–1088
Kasteleyn PW (1961) The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice. Physica (Amsterdam) 27:1209–1225
Kong Y (2006) Packing dimers on $(2p+1)\times (2q+1)$ lattices. Phys Rev E 73:016106 (11 pages)
Kong Y (2006a) Logarithmic corrections in the free energy of monomer-dimer model on plane lattices with free boundaries. Phys Rev E 74:011102 (8 pages)
Kong Y (2006b) Monomer-dimer model in two-dimensional rectangular lattices with fixed dimer density. Phys Rev E 74:061102 (15 pages)
Lu WT, Wu FY (1999) Dimer statistics on the Möbius strip and the Klein bottle. Phys Lett A 259:108–114
Mandelbrot BB (1982) The Fractal Geometry of Nature. Freeman, San Francisco
Temperley HNV, Fisher ME (1961) Dimer problem in statistical mechanics-an exact result. Philos Magn 6:1061–1063
Tzeng W-J, Wu FY (2003) Dimers on a simple-quartic net with a vacancy. J Stat Phys 110:671–689
Wu FY (2006) Pfaffian solution of a dimer-monomer problem: Single monomer on the boundary. Phys Rev E 74: 020104(R) (4 pages); Wu FY (2006) Erratum: Pfaffian solution of a dimer-monomer problem: Single monomer on the boundary. [Phys Rev E 74, 020104(R) (2006)] 74: 039907(E) (1 page)
Yan W, Yeh Y-N (2006) On the number of matchings of graphs formed by a graph operation. Sci Chin A Math 49:1383–1391
Yan W, Yeh Y-N, Zhang F (2005) On the matching polynomials of graphs with small number of cycles of even length. Int J Quant Chem 105:124–130
Zhang Z, Wu S, Li M, Comellas F (2016) The number and degree distribution of spanning trees in the Tower of Hanoi graph. Theor Comput Sci 609:443–455
Acknowledgements
This research of S.-C.C. was supported in part by the MOST Grant 107-2515-S-006-002.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Maria Aguieiras de Freitas.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
A Proof of the monotonicity of \(\omega _3(n)\) and \(\alpha _3(n)\)
A Proof of the monotonicity of \(\omega _3(n)\) and \(\alpha _3(n)\)
We shall show that \(\omega _3(n)\) is an ascending function and \(\alpha _3(n)\) a descending function here. Using a, b, c to denote \(\alpha _3(n)-\beta _3(n)\), \(\beta _3(n)-\gamma _3(n)\), \(\gamma _3(n)-\omega _3(n)\), respectively, and the definition given in Eq. (21), we find that \(\omega _3(n+1)\) is always larger than \(\omega _3(n)\) as follows.
where the inequality holds since all terms are positive. The relation \(\alpha _3(n)-\alpha _3(n+1) > 0\) can be proved similarly, such that \(\alpha _3(n)\) decreases monotonically as n increases.
Rights and permissions
About this article
Cite this article
Li, WB., Chang, SC. Study of dimer–monomer on the generalized Hanoi graph. Comp. Appl. Math. 39, 77 (2020). https://doi.org/10.1007/s40314-020-1088-x
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-020-1088-x