Approximating the number of monomer-dimer coverings of a lattice. (Q1593404)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1554072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the number of monomer-dimer coverings of a lattice. |
scientific article; zbMATH DE number 1554072 |
Statements
Approximating the number of monomer-dimer coverings of a lattice. (English)
0 references
16 January 2001
0 references
monomer-dimer problem
0 references
dimer coverings
0 references
lattice statistics
0 references
Monte Carlo methods
0 references
relaxation time
0 references
mixing time
0 references
approximation algorithm
0 references
Fisher-Kasteleyn-Temperley algorithm
0 references
perfect matching
0 references
monomer-dimer correlations
0 references
vertex-transitive graphs
0 references
0 references
0 references
0.8565078973770142
0 references
0.8089853525161743
0 references
0.8012082576751709
0 references
