A Bijection for Directed-Convex Polyominoes
Résumé
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.
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|
Loading...