Counting dimer coverings on self-similar Schreier graphs (Q444407)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting dimer coverings on self-similar Schreier graphs |
scientific article; zbMATH DE number 6065712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting dimer coverings on self-similar Schreier graphs |
scientific article; zbMATH DE number 6065712 |
Statements
Counting dimer coverings on self-similar Schreier graphs (English)
0 references
14 August 2012
0 references
partition function
0 references
dimer model
0 references
infinite self-similar graphs
0 references
approximation sequence
0 references
fractals
0 references
rooted trees
0 references
Hanoi towers
0 references
Sierpinski gasket
0 references
0 references
0.7958824038505554
0 references
0.7928662896156311
0 references
0.7880988717079163
0 references
0.7622454762458801
0 references
0.7570896148681641
0 references
