Counting dimer coverings on self-similar Schreier graphs

DOI10.1016/J.EJC.2012.03.014zbMATH Open1246.05128arXiv1109.1190OpenAlexW1991682306MaRDI QIDQ444407FDOQ444407

Authors: Daniele D'Angeli, Alfredo Donno, Tatiana Nagnibeda 

Publication date: 14 August 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/1109.1190

Recommendations

• Weighted spanning trees on some self-similar graphs
• Partition functions of the Ising model on some self-similar Schreier graphs
• Dimer–monomer model on the Towers of Hanoi graphs
• Enumeration problems for classes of self-similar graphs
• Dimer coverings on the Tower of Hanoi graph

zbMATH Keywords

partition functionfractalsSierpinski gasketdimer modelrooted treesapproximation sequenceHanoi towersinfinite self-similar graphs

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Exactly solvable models; Bethe ansatz (82B23) Graph theory (05C99)

Cites Work

• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Title not available (Why is that?)
• Dimer problem in statistical mechanics-an exact result
• Title not available (Why is that?)
• Dimers and amoebae
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lectures on Dimers
• Title not available (Why is that?)
• On the spectrum of Hecke type operators related to some fractal groups
• Schreier graphs of the Basilica group.
• ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
• Exact and asymptotic enumeration of perfect matchings in self-similar graphs
• Self-similarity and branching in group theory.
• Partition functions of the Ising model on some self-similar Schreier graphs
• Enumeration of matchings in families of self-similar graphs
• Dimer coverings on the Sierpinski gasket

Cited In (17)

• Schreier graphs of spinal groups
• Weighted spanning trees on some self-similar graphs
• Dimer coverings on the Tower of Hanoi graph
• Statistics of close-packed dimers on fractal lattices
• The ice model on the three-dimensional Hanoi graph
• Enumeration of matchings in families of self-similar graphs
• Metric compactification of infinite Sierpiński carpet graphs
• Perfect matchings on a type of lattices with toroidal boundary
• Partition functions of the Ising model on some self-similar Schreier graphs
• Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs
• Study of dimer-monomer on the generalized Hanoi graph
• Interacting dimers on a Sierpinski gasket
• Graph automaton groups
• Spectra of Schreier graphs of Grigorchuk's group and Schroedinger operators with aperiodic order
• Pfaffian orientations and perfect matchings of scale-free networks
• Connectedness and isomorphism properties of the zig-zag product of graphs
• Maximum matchings in scale-free networks with identical degree distribution

This page was built for publication: Counting dimer coverings on self-similar Schreier graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444407)