No label defined (Q4832435)
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 2125075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2125075 |
Statements
4 January 2005
0 references
0.90555036
0 references
0 references
0 references
0 references
0.8554503
0 references
0.8554503
0 references
0 references
0.8536005
0 references
This is a concise introduction to the dimer model and variants. The dimer model is the study of the family of perfect matchings of a graph, i.e., the family of edge subsets such that every vertex of the graph appears as the endpoint of precisely one edge of that subset. The author concentrates on the graph \(\mathbb Z^ 2\) and subsets of \(\mathbb Z^ 2\) with special geometry, like squares, rectangles and Aztec diamonds (leading to the problem of artic circles). For these graphs, a perfect matching may be seen as a domino tiling, i.e., coverings with \(2\times 1\) and \(1\times 2\) rectangles. The problem of conformal invariance is discussed, and also more general planar graphs are considered, like the FK-percolation model and some special families of planar graphs. A number of figures illustrate the problems and results. Proofs are concisely outlined. For the entire collection see [Zbl 1048.60004].
0 references