Abstract
AbstractWe prove that for the ‐regular tessellations of the hyperbolic plane by ‐gons, there are exponentially more self‐avoiding walks of length than there are self‐avoiding polygons of length . We then prove that this property implies that the self‐avoiding walk is ballistic, even on an arbitrary vertex‐transitive graph. Moreover, for every fixed , we show that the connective constant for self‐avoiding walks satisfies the asymptotic expansion as ; on the other hand, the connective constant for self‐avoiding polygons remains bounded. Finally, we show for all but two tessellations that the number of self‐avoiding walks of length is comparable to the th power of their connective constant. Some of these results were previously obtained by Madras and Wu for all but finitely many regular tessellations of the hyperbolic plane.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
