Del Lungo, Alberto and Mirolli, Massimo and Pinzani, Renzo and Rinaldi, Simone - A Bijection for Directed-Convex Polyominoes

dmtcs:2298 - Discrete Mathematics & Theoretical Computer Science, January 1, 2001, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
A Bijection for Directed-Convex Polyominoes

Authors: Del Lungo, Alberto and Mirolli, Massimo and Pinzani, Renzo and Rinaldi, Simone

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.


Volume: DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
Section: Proceedings
Published on: January 1, 2001
Submitted on: November 21, 2016
Keywords: cycle lemma,directed-convex polyominoes,binomial coefficients,lattice paths,[INFO] Computer Science [cs],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]


Share

Consultation statistics

This page has been seen 96 times.
This article's PDF has been downloaded 80 times.