The number of convex polyominoes and the generating function of Jacobi polynomials
Lin and Chang gave a generating function of convex polyominoes with an m+1 m + 1 by n+1 n + 1 minimal bounding rectangle. Gessel showed that their result implies that the number of such polyominoes is Some (binomial coefficients) identities arise from alternative solutions of combinatorial problems and incidentally give added significance to doing problems the hard way. J. RIORDAN
convex polyominoes generating function jacobi polynomials chuvandermonde formula