Dimer coverings on the Sierpinski gasket
From MaRDI portal
Publication:930369
DOI10.1007/S10955-008-9516-0zbMATH Open1144.82009arXiv0711.0573OpenAlexW1495099710MaRDI QIDQ930369FDOQ930369
Shu-Chiuan Chang, Lung-Chi Chen
Publication date: 30 June 2008
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Abstract: We present the number of dimers on the Sierpinski gasket at stage with dimension equal to two, three, four or five, where one of the outmost vertices is not covered when the number of vertices is an odd number. The entropy of absorption of diatomic molecules per site, defined as , is calculated to be exactly for . The numbers of dimers on the generalized Sierpinski gasket with and are also obtained exactly. Their entropies are equal to , , , respectively. The upper and lower bounds for the entropy are derived in terms of the results at a certain stage for with . As the difference between these bounds converges quickly to zero as the calculated stage increases, the numerical value of with can be evaluated with more than a hundred significant figures accurate.
Full work available at URL: https://arxiv.org/abs/0711.0573
Recommendations
Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Quantum equilibrium statistical mechanics (general) (82B10)
Cites Work
- Dimers on a simple-quartic net with a vacancy
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Statistical Mechanics of Dimers on a Plane Lattice
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dimer problem in statistical mechanics-an exact result
- Title not available (Why is that?)
- Self-avoiding random walks: Some exactly soluble cases
- DIMERS ON TWO-DIMENSIONAL LATTICES
- Title not available (Why is that?)
- The exponent for the mean square displacement of self-avoiding random walk on the Sierpinski gasket
- Self-avoiding paths on the pre-Sierpinski gasket
- Title not available (Why is that?)
- EXACT FORMULA FOR THE MEAN LENGTH OF A RANDOM WALK ON THE SIERPINSKI TOWER
Cited In (17)
- MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB
- Asymptotic behavior of a generalized independent sets model on the two-dimensional Sierpinski gasket
- Dimer coverings on the Tower of Hanoi graph
- Statistics of close-packed dimers on fractal lattices
- Counting dimer coverings on self-similar Schreier graphs
- Enumeration of matchings in families of self-similar graphs
- Exact and asymptotic enumeration of perfect matchings in self-similar graphs
- MEAN TIME TO ABSORPTION ON THE JOINT SIERPINSKI GASKET
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
- AVERAGE TRAPPING TIME ON THE 3-DIMENSIONAL 3-LEVEL SIERPINSKI GASKET NETWORK WITH A SET OF TRAP NODES
- Interacting dimers on a Sierpinski gasket
- The mean time to absorption on horizontal partitioned Sierpinski gasket networks
- Random walks on dual Sierpinski gaskets
- Some two-point resistances of the Sierpinski gasket network
- Resistance scaling and the number of spanning trees in self-similar lattices
- Acyclic orientations on the Sierpinski gasket
- Connectivity and some other properties of generalized Sierpiński graphs
This page was built for publication: Dimer coverings on the Sierpinski gasket
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930369)