Self-avoiding walk enumeration via the lace expansion
- Date: 12/12/2006
Lecturer(s):
Nathan Clisby (University of Melbourne)
Location:
University of British Columbia
Topic:
We introduce a new method for the enumeration of self-avoiding walks
based on the lace expansion combined with another algorithmic
improvement which we call the two step method. We have been able to
significantly extend series for the simple cubic lattice from 26 to 30
terms, and dramatically extend series for hypercubic lattices for all
dimensions greater than three.
Other Information:
Probability Seminar 2006
Sponsor:
