Counting dimer coverings on self-similar Schreier graphs
DOI10.1016/j.ejc.2012.03.014zbMath1246.05128arXiv1109.1190OpenAlexW1991682306MaRDI QIDQ444407
Tatiana Nagnibeda, Daniele D'Angeli, Alfredo Donno
Publication date: 14 August 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.1190
partition functionfractalsSierpinski gasketrooted treesdimer modelapproximation sequenceHanoi towersinfinite self-similar graphs
Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Exactly solvable models; Bethe ansatz (82B23) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph theory (05C99)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration of matchings in families of self-similar graphs
- Dimer coverings on the Sierpinski gasket
- Schreier graphs of the Basilica group.
- Exact and asymptotic enumeration of perfect matchings in self-similar graphs
- Dimers and amoebae
- The statistics of dimers on a lattice
- Lectures on Dimers
- ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
- Partition Functions of the Ising Model on Some Self-similar Schreier Graphs
- Dimer problem in statistical mechanics-an exact result