Counting dimer coverings on self-similar Schreier graphs

Details Counting dimer coverings on self-similar Schreier graphs Counting dimer coverings on self-similar Schreier graphs

2011-09-06

arxiv.org/abs/1109.1190v2

Mathematics

Combinatorics

29 pages. Final version, to appear in European Journal of Combinatorics

Scientific paper

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\'nski gasket.

Affiliated with

Also associated with

No associations

Rating

Counting dimer coverings on self-similar Schreier graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting dimer coverings on self-similar Schreier graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting dimer coverings on self-similar Schreier graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-93711