Counting dimer coverings on self-similar Schreier graphs

16Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We study partition functions for the dimer model on families of finite graphs converging to infinite self-similar graphs and forming approximation sequences to certain well-known fractals. The graphs that we consider are provided by actions of finitely generated groups by automorphisms on rooted trees, and thus their edges are naturally labeled by the generators of the group. It is thus natural to consider weight functions on these graphs taking different values according to the labeling. We study in detail the well-known example of the Hanoi Towers group H (3), closely related to the Sierpiński gasket. © 2012 Elsevier Ltd.

Cite

CITATION STYLE

APA

D’Angeli, D., Donno, A., & Nagnibeda, T. (2012). Counting dimer coverings on self-similar Schreier graphs. European Journal of Combinatorics, 33(7), 1484–1513. https://doi.org/10.1016/j.ejc.2012.03.014

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free