Name
Abstract | ||
|---|---|---|
In this paper we consider two classes of lattice paths on the plane which use north, east, south, and west unitary steps, beginning and ending at 0 0 . We enumerate them according to the number of steps 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. |
Year | Venue | Keywords |
|---|---|---|
2001 | DM-CCG | cycle lemma,binomial coefficients,directed-convex polyominoes,lattice paths.,binomial coefficient |
Field | DocType | Citations |
Row and column spaces,Discrete mathematics,Combinatorics,Bijection,Lattice (order),Polyomino,Regular polygon,Unitary state,Bijective proof,Binomial coefficient,Mathematics | Conference | 3 |
PageRank | References | Authors |
0.56 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alberto Del Lungo | 1 | 376 | 44.84 |
| Massimo Mirolli | 2 | 3 | 1.24 |
| Renzo Pinzani | 3 | 341 | 67.45 |
| Simone Rinaldi | 4 | 12 | 3.39 |