The number of convex polyominoes and the generating function of Jacobi polynomials
From MaRDI portal
Publication:2489952
Abstract: Lin and Chang gave a generating function of convex polyominoes with an by 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- A note on two identities arising from enumeration of convex polyominoes
- Algebraic languages and polyominoes enumeration
- Binomial determinants, paths, and hook length formulae
- Coding the convex polyominoes and equations for the enumeration according to the area
- Enumeration of three-dimensional convex polygons
- Generating Functions for Bessel and Related Polynomials
- On the number of convex polyominoes.
- Polynomes de Jacobi, Interpretation Combinatoire et Fonction Generatrice
- The number of convex polyominoes with given perimeter
Cited in
(9)- The generating function of convex polyominoes: The resolution of a \(q\)- differential system
- Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees
- A note on two identities arising from enumeration of convex polyominoes
- Factors of sums and alternating sums involving binomial coefficients and powers of integers
- A geometric bijection for \(xy\)-convex curves and convex polyominoes
- \(q\)-enumeration of convex polyominoes
- On the exhaustive generation of \(k\)-convex polyominoes
- The \(h\)-polynomial and the rook polynomial of some polyominoes
- Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions
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)