Planar lattice gases with nearest-neighbor exclusion (Q1306594)

The hard-hexagon and hard-square problems, as well as the corresponding problems on the honeycomb lattice are discussed. The case when the activity is unity is of interest to combinatorialists, being the problem of counting binary matrices with no two adjacent 1's. For this case, the author uses the powerful corner transfer matrix method to evaluate numerically the partition function per site, density and some near-neighbor correlations to high accuracy. In particular, for the square lattice, he obtaines the partition function per site to 43 decimal places.