Abstract
We present an analytical technique for counting exactly the number of ways of embedding a graph in a fairly general family of self-similar deterministic fractals. As a result, series expansion for statistical systems can be obtained that are exact order by order in the expansion parameter. As an illustration, series expansions for self-avoiding walks on a Sierpriaanski carpet are given. Analytical results for systems on infinitely ramified fractals are obtained in the thermodynamic limit without making any approximation on the lattice.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Physical review. A, Atomic, molecular, and optical physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.