Abstract
Dimer problem for three dimensional lattice is an unsolved problem in statistical mechanics and solid-state chemistry. In this paper, we obtain asymptotical expressions of the number of close-packed dimers (perfect matchings) for two types of three dimensional lattice graphs. Let M(G) denote the number of perfect matchings of G. Then log(M(K2×C4×Pn))≈(−1.171⋅n−1.1223+3.146)n, and log(M(K2×P4×Pn))≈(−1.164⋅n−1.196+2.804)n, where log() denotes the natural logarithm. Furthermore, we obtain a sufficient condition under which the lattices with multiple cylindrical and multiple toroidal boundary conditions have the same entropy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
