Enumerating some classes of lattice polygons
by Nick Beaton
The problem of counting the number of self-avoiding polygons on a lattice is quite difficult (to put it mildly). One approach is to study sub-classes which satisfy some given restrictions (eg.
directedness or prudence). In this talk I will discuss some of these sub-classes, the methods used to count them, and some recent interesting results.
For More Information: For more information contact Mark Sorrell. firstname.lastname@example.org