Atlas home || Conferences | Abstracts | about Atlas

25th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing
December 4-8, 2000
University of Canterbury
Christchurch, New Zealand

Organizers
Charles Semple, Mike Steel

View Abstracts
Conference Homepage

Counting parallelogram polyominoes on the triangular lattice
by
Andrew Oppenheim
University of Melbourne

Parallelogram polyominoes, also known as staircase polygons, are the subset of lattice polygons for which both the upper and lower boundaries leaving the origin are directed to move up and to the right.

Temperley's method is used to find generating functions that enumerate triangular lattice parallelogram polyominoes by their perimeter and by their first area-weighted moment.

Date received: November 8, 2000


Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafn-40.