Computation of terms in the asymptotic expansion of dimer _d for high dimension
From MaRDI portal
(Redirected from Publication:763788)
Computation of terms in the asymptotic expansion of dimer \(\lambda d\) for high dimension
Computation of terms in the asymptotic expansion of dimer \(\lambda d\) for high dimension
Abstract: The dimer problem arose in a thermodynamic study of diatomic molecules, and was abstracted into one of the most basic and natural problems in both statistical mechanics and combinatoric mathematics. Given a rectangular lattice of volume V in d dimensions, the dimer problem loosely speaking is to count the number of different ways dimers (dominoes) may be laid down in the lattice (without overlapping) to completely cover it. Each dimer covers two neighboring vertices. It is known that the number of such coverings is roughly exp(lambda_d V) for some constant lambda_d as V goes to infinity. Herein we present a mathematical argument for an asymptotic expansion for lambda_d in inverse powers of d, and the results of computer computations for the first few terms in the series. As a glaring challenge, we conjecture no one will compute the next term in the series, due to the requisite computer time and storage demands.
Recommendations
- Asymptotic expansions for \(\lambda _{d }\) of the dimer and monomer-dimer problems
- Dimer model: full asymptotic expansion of the partition function
- Computation of principal \({\mathcal A}\)-determinants through dimer dynamics
- An asymptotic expansion and recursive inequalities for the monomer-dimer problem
- Asymptotics of height change on toroidal Temperleyan dimer models
- High dimensional asymptotic expansions for the matrix Langevin distributions on the Stiefel manifold
- Asymptotics of block Toeplitz determinants and the classical dimer model
- Perturbation theory for the random dimer model
- Asymptotic expansion of the mean-field approximation
Cites work
- An asymptotic solution of the multidimensional dimer problem
- An improved upper bound for the \(3\)-dimensional dimer problem
- Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension
- Counting 1-factors in regular bipartite graphs
- scientific article; zbMATH DE number 4078467 (Why is no real title available?)
- scientific article; zbMATH DE number 2064637 (Why is no real title available?)
- scientific article; zbMATH DE number 3248840 (Why is no real title available?)
- On the validations of the asymptotic matching conjectures
- Statistical Mechanics of Dimers on a Plane Lattice
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
Cited in
(4)- Asymptotic expansions for \(\lambda _{d }\) of the dimer and monomer-dimer problems
- Matchings in vertex-transitive bipartite graphs
- An asymptotic expansion and recursive inequalities for the monomer-dimer problem
- Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension
This page was built for publication: Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763788)