The number of convex polyominoes and the generating function of Jacobi polynomials

From MaRDI portal
Publication:2489952

DOI10.1016/J.DAM.2005.10.007zbMATH Open1090.05017arXivmath/0403262OpenAlexW2052166373MaRDI QIDQ2489952FDOQ2489952


Authors: Victor J. W. Guo, Jiang Zeng Edit this on Wikidata


Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: Lin and Chang gave a generating function of convex polyominoes with an m+1 by n+1 minimal bounding rectangle. Gessel showed that their result implies that the number of such polyominoes is frac{m+n+mn}{m+n}{2m+2nchoose 2m}-frac{2mn}{m+n}{m+nchoose m}^2. We show that this result can be derived from some binomial coefficients identities related to the generating function of Jacobi polynomials.


Full work available at URL: https://arxiv.org/abs/math/0403262




Recommendations




Cites Work


Cited In (8)





This page was built for publication: The number of convex polyominoes and the generating function of Jacobi polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489952)