Discrete Mathematics & Theoretical Computer Science · 2001 · 11 citations · 7 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsDiscrete MathematicsAlgebraic CombinatoricsBijective CombinatoricsCombinatorial EnumerationEnumerative CombinatoricsBijective EnumerationCombinatorial LatticesCycle LemmaLattice Path EnumerationPolytope Enumeration
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.
7
The encyclopedia of integer sequences
Choice Reviews Online · 1995 · 603 citations
Algebraic languages and polyominoes enumeration
M. Delest, Gérard Viennot · Theoretical Computer Science · 1984 · 328 citations
A. Dvoretzky, Th. Motzkin · Duke Mathematical Journal · 1947 · 180 citations