A Bijection for Directed-Convex PolyominoesReport as inadecuate




A Bijection for Directed-Convex Polyominoes - Download this document for free, or read online. Document in PDF available to download.

1 DSMI - Department of Mathematics and Computer Science - Dipartimento di Scienze Matematiche e Informatiche -Roberto Magari- 2 DSI - Dipartimento di Sistemi e Informatica

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.

Keywords : cycle lemma directed-convex polyominoes binomial coefficients lattice paths





Author: Alberto Del Lungo - Massimo Mirolli - Renzo Pinzani - Simone Rinaldi -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents