School Seminars and Colloquia

Enumerating some classes of lattice polygons

Tuesday Seminar

by Nick Beaton


Institution: Department of Mathematics and Statistics
Date: Tue 9th March 2010
Time: 1:00 PM
Location: Room 213

Abstract: Abstract:
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. msorrell@unimelb.edu.au