Skip to Main content Skip to Navigation
Book sections

Exactly solved models of polyominoes and polygons

Abstract : This chapter deals with the exact enumeration of certain classes of self-avoiding polygons and polyominoes on the square lattice. We present three general approaches that apply to many classes of polyominoes. The common principle to all of them is a recursive description of the polyominoes which then translates into a functional equation satisfied by the generating function. The first approach applies to classes of polyominoes having a linear recursive structure and results in a rational generating function. The second approach applies to classes of polyominoes having an algebraic recursive structure and results in an algebraic generating function. The third approach, commonly called the Temperley method, is based on the action of adding a new column to the polyominoes. We conclude by discussing some open questions.
Document type :
Book sections
Complete list of metadata

Cited literature [56 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00342024
Contributor : Mireille Bousquet-Mélou Connect in order to contact the contributor
Submitted on : Wednesday, November 26, 2008 - 3:22:11 PM
Last modification on : Monday, December 20, 2021 - 4:50:10 PM
Long-term archiving on: : Monday, June 7, 2010 - 11:26:51 PM

Files

polygon_B3.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Mireille Bousquet-Mélou, Richard Brak. Exactly solved models of polyominoes and polygons. Polygons, Polyominoes and Polycubes, Springer Berlin / Heidelberg, pp.43-78, 2009, Lecture Notes in Physics, ⟨10.1007/978-1-4020-9927-4⟩. ⟨hal-00342024⟩

Share

Metrics

Les métriques sont temporairement indisponibles