| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420318 | Discrete Applied Mathematics | 2006 | 7 Pages |
Abstract
Lin and Chang gave a generating function of convex polyominoes with an m+1m+1 by n+1n+1 minimal bounding rectangle. Gessel showed that their result implies that the number of such polyominoes ism+n+mnm+n2m+2n2m-2mnm+nm+nm2.We show that this result can be derived from some binomial coefficients identities related to the generating function of Jacobi polynomials.Some (binomial coefficients) identities arise from alternative solutions of combinatorial problems and incidentally give added significance to doing problems the “hard” way.—J. RIORDAN
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Victor J.W. Guo, Jiang Zeng,