Theory of computation of multidimensional entropy with an application to the monomer-dimer problem (Q2568107)

The paper deals with the exponential growth rate (with respect to the natural logarithm) of the number of configurations on a multidimensional grid and gives recent results on its computation. The basic concepts referred to are dimer (domino consisting of two neighbouring atoms occupying some special places), monomer (single atom occupying a given place), monomer-dimer cover (partition into monomers and diners), dimmer cover (partition into dimmers). The paper proposes a new computation algorithm for monomer-dimer entropy with a given dimer density. The volume of computation is reduced by using automorphism subgroups. Numerical results are displayed for monomer-dimer entropy in two and three dimensions.