Directed column-convex polyominoes by recurrence relations
From MaRDI portal
Publication:5044743
Recommendations
Cites work
Cited in
(22)- ``Deco polyominoes, permutations and random generation
- Polyominoes defined by their vertical and horizontal projections
- Enumerations of peaks and valleys on non-decreasing Dyck paths
- A bijection between directed column-convex polyominoes and ordered trees of height at most three
- A method for the enumeration of various classes of column-convex polygons
- Enumeration of the directed convex polyominoes
- An alternative method for \(q\)-counting directed column-convex polyominoes.
- Enumerations of rational non-decreasing Dyck paths with integer slope
- Smooth column convex polyominoes
- Ascent sequences avoiding pairs of patterns
- Enumerating several aspects of non-decreasing Dyck paths
- Two generalizations of column-convex polygons
- Some enumerations on non-decreasing Motzkin paths
- Enumerating symmetric peaks in non-decreasing Dyck paths
- A technology for reverse-engineering a combinatorial problem from a rational generating function
- The height of directed column-convex polyominoes
- Combinatorial results for order-preserving partial injective contraction mappings
- Enumeration of plateau polycubes with respect to their lateral area
- Some connections between restricted Dyck paths, polyominoes, and non-crossing partitions
- Odd-indexed Fibonacci numbers via pattern-avoiding permutations
- The average height of directed column-convex polyominoes having square, hexagonal and triangular cells
- Consecutive patterns: from permutations to column-convex polyominoes and back
This page was built for publication: Directed column-convex polyominoes by recurrence relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044743)