A Bijection for Directed-Convex Polyominoes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2001

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.
Fichier principal
Vignette du fichier
dmAA0109.pdf (111.27 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01182978 , version 1 (06-08-2015)

Identifiants

Citer

Alberto del Lungo, Massimo Mirolli, Renzo Pinzani, Simone Rinaldi. A Bijection for Directed-Convex Polyominoes. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.133-144, ⟨10.46298/dmtcs.2298⟩. ⟨hal-01182978⟩

Collections

INSMI TDS-MACS
74 Consultations
736 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More