A Bijection for Directed-Convex Polyominoes

Alberto Del Lungo, Massimo Mirolli, Renzo Pinzani, Simone Rinaldi

Discrete Mathematics & Theoretical Computer Science · 2001 · 11 citations · 7 references

DOIFull text

Open access

Concepts

Abstract

In this paper we consider two classes of lattice paths on the plane which use \textitnorth, \textiteast, \textitsouth,and \textitwest unitary steps, beginningand ending at (0,0).We enumerate them according to the number ofsteps by means of bijective arguments; in particular, we apply the cycle lemma.Then, using these results, we provide a bijective proof for the number of directed-convex polyominoes having a fixed number of rows and columns.

References

7