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.
Recommendations
Cites work
- scientific article; zbMATH DE number 503283 (Why is no real title available?)
- scientific article; zbMATH DE number 1994007 (Why is no real title available?)
- scientific article; zbMATH DE number 3794378 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3401212 (Why is no real title available?)
- DIMERS ON TWO-DIMENSIONAL LATTICES
- Dimer problem in statistical mechanics-an exact result
- Dimers on a simple-quartic net with a vacancy
- EXACT FORMULA FOR THE MEAN LENGTH OF A RANDOM WALK ON THE SIERPINSKI TOWER
- Self-avoiding paths on the pre-Sierpinski gasket
- Self-avoiding random walks: Some exactly soluble cases
- Statistical Mechanics of Dimers on a Plane Lattice
- The exponent for the mean square displacement of self-avoiding random walk on the Sierpinski gasket
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
Cited in
(18)- Interacting dimers on a Sierpinski gasket
- Dimer coverings on the Tower of Hanoi graph
- AVERAGE TRAPPING TIME ON THE 3-DIMENSIONAL 3-LEVEL SIERPINSKI GASKET NETWORK WITH A SET OF TRAP NODES
- The mean time to absorption on horizontal partitioned Sierpinski gasket networks
- Study of dimer-monomer on the generalized Hanoi graph
- Statistics of close-packed dimers on fractal lattices
- Counting dimer coverings on self-similar Schreier graphs
- Resistance scaling and the number of spanning trees in self-similar lattices
- Acyclic orientations on the Sierpinski gasket
- Enumeration of matchings in families of self-similar graphs
- Mean time to absorption on the joint Sierpinski gasket
- Exact and asymptotic enumeration of perfect matchings in self-similar graphs
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
- Maximum matchings in a pseudofractal scale-free web
- Some two-point resistances of the Sierpinski gasket network
- Asymptotic behavior of a generalized independent sets model on the two-dimensional Sierpinski gasket
- Random walks on dual Sierpinski gaskets
- 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)