Planar lattice gases with nearest-neighbor exclusion (Q1306594)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Planar lattice gases with nearest-neighbor exclusion
scientific article

    Statements

    Planar lattice gases with nearest-neighbor exclusion (English)
    0 references
    4 April 2000
    0 references
    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.
    0 references
    legal matrices
    0 references
    hard-hexagon and hard-square problems
    0 references
    honeycomb lattice
    0 references
    transfer matrix
    0 references
    square lattice
    0 references
    partition function
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references