Directed column-convex polyominoes by recurrence relations
From MaRDI portal
Publication:5044743
DOI10.1007/3-540-56610-4_71zbMath1497.05032OpenAlexW1490173767MaRDI QIDQ5044743
Renzo Sprugnoli, Renzo Pinzani, Elena Barcucci
Publication date: 2 November 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-56610-4_71
Exact enumeration problems, generating functions (05A15) Nonnumerical algorithms (68W05) Information storage and retrieval of data (68P20) Polyominoes (05B50)
Related Items
A bijection between directed column-convex polyominoes and ordered trees of height at most three, ``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 method for the enumeration of various classes of column-convex polygons, The average height of directed column-convex polyominoes having square, hexagonal and triangular cells, A technology for reverse-engineering a combinatorial problem from a rational generating function, Ascent sequences avoiding pairs of patterns, Enumerations of rational non-decreasing Dyck paths with integer slope, Enumerating several aspects of non-decreasing Dyck paths, Unnamed Item, Enumerating symmetric peaks in non-decreasing Dyck paths
Cites Work
