The number of directed k-convex polyominoes
From MaRDI portal
Abstract: We present a new method to obtain the generating functions for directed convex polyominoes according to several different statistics including: width, height, size of last column/row and number of corners. This method can be used to study different families of directed convex polyominoes: symmetric polyominoes, parallelogram polyominoes. In this paper, we apply our method to determine the generating function for directed k-convex polyominoes. We show it is a rational function and we study its asymptotic behavior.
Recommendations
Cited in
(15)- A bijective perimeter enumeration of directed convex polyominoes
- A new occurrence of Catalan numbers: cap permutations
- Periodic parallelogram polyominoes
- Enumeration of the directed convex polyominoes
- An alternative method for \(q\)-counting directed column-convex polyominoes.
- The number of directed \(k\)-convex polyominoes
- On the enumeration of \(k\)-omino towers
- On directed-convex polyominoes in a rectangle
- Geometric properties of matrices induced by pattern avoidance
- Counting k-convex polyominoes
- scientific article; zbMATH DE number 841833 (Why is no real title available?)
- On the exhaustive generation of \(k\)-convex polyominoes
- The number of \(k\)-parallelogram polyominoes
- A generic method for the enumeration of various classes of directed polycubes
- The height of directed column-convex polyominoes
This page was built for publication: The number of directed \(k\)-convex polyominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803319)