Interacting dimers on a Sierpinski gasket (Q1095958): Difference between revisions

The different manners of embedding subgraphs of many disjoint edges in a parent graph arise in several different chemical and physical contexts. The problem of enumeration, or more generally of weighted summation, of such embeddings seems quite difficult to treat quantitatively, at least for general extended graphs. The special extended parent graph treated here with the inclusion of interaction between dimers is that of a Sierpinski gasket with a fractal dimension of ln 3/ln 2. The manners of solution should extend to other fractal graphs with low `ramification degree'.