Abstract
We give an elementary new method for obtaining rigorous lower bounds on the connective constant for self-avoiding walks on the hypercubic lattice ℤ d . The method is based on loop erasure and restoration, and does not require exact enumeration data. Our bounds are best for highd, and in fact agree with the first four terms of the 1/d expansion for the connective constant. The bounds are the best to date for dimensionsd⩾ 3, but do not produce good results in two dimensions. Ford=3, 4, 5, and 6, respectively, our lower bound is within 2.4%, 0.43%, 0.12%, and 0.044% of the value estimated by series extrapolation.
Sign-in/Register to access full text options 
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.
